Homomorphic public-key cryptosystems and encrypting boolean circuits

D.  Grigoriev.; I.  Ponomarenko

Paper 2003/025

Homomorphic public-key cryptosystems and encrypting boolean circuits

D. Grigoriev. and 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.

Metadata

Available format(s): PS
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): dima @ maths univ-rennes1 fr
History: 2003-02-11: received
Short URL: https://ia.cr/2003/025
License: CC BY

BibTeX

@misc{cryptoeprint:2003/025,
      author = {D.  Grigoriev. and I.  Ponomarenko},
      title = {Homomorphic public-key cryptosystems and encrypting boolean circuits},
      howpublished = {Cryptology ePrint Archive, Paper 2003/025},
      year = {2003},
      note = {\url{https://eprint.iacr.org/2003/025}},
      url = {https://eprint.iacr.org/2003/025}
}