Computer Science – Cryptography and Security
Scientific paper
2003-01-22
Computer Science
Cryptography and Security
Scientific paper
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.
Grigoriev Dima
Ponomarenko Ilia
No associations
LandOfFree
Homomorphic public-key cryptosystems and encrypting boolean circuits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Homomorphic public-key cryptosystems and encrypting boolean circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Homomorphic public-key cryptosystems and encrypting boolean circuits will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-198871