Cryptology ePrint Archive: Report 2003/025

Homomorphic public-key cryptosystems and encrypting boolean circuits

D.Grigoriev. I.Ponomarenko

Abstract: Homomorphic cryptosystems are designed for the first time over any finite group. Applying Barrington's construction we produce for any boolean circuit of the logarithmic depth its encrypted simulation of a polynomial size over an appropriate finitely generated group.

Category / Keywords: public-key cryptography /

Date: received 9 Feb 2003

Contact author: dima at maths univ-rennes1 fr

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation

Version: 20030211:031638 (All versions of this report)

Discussion forum: Show discussion | Start new discussion