CryptoDB
Homomorphic public-key cryptosystems and encrypting boolean circuits
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2003-11743, title={Homomorphic public-key cryptosystems and encrypting boolean circuits}, booktitle={IACR Eprint archive}, keywords={public-key cryptography /}, url={http://eprint.iacr.org/2003/025}, note={ dima@maths.univ-rennes1.fr 12092 received 9 Feb 2003}, author={D.Grigoriev. I.Ponomarenko}, year=2003 }