Homomorphic public-key cryptosystems and encrypting boolean circuits
Grigoriev, Dima · Ponomarenko, Ilia
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.