Welcome to the resource topic for 2003/025
Title:
Homomorphic public-key cryptosystems and encrypting boolean circuits
Authors: D. Grigoriev., 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.
ePrint: https://eprint.iacr.org/2003/025
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .