Homomorphic public-key cryptosystems and encrypting boolean circuits
classification
💻 cs.CR
keywords
booleancryptosystemsgrouphomomorphicapplyingappropriatebarringtoncircuit
read the original abstract
In this paper 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.