Zum Vortrag von Dima Grigoriev: 17.07.2003
HOMOMORHIC PUBLIC-KEY CRYPTOSYSTEMS and
ENCRYPTING BOOLEAN CIRCUITS
Abstract:
Homomorphic cryptosystems are designed for the first time over
any finite group. Applying Barrington's construction we produce for
any boolean circuit of logarithmic depth its encrypted simulation of
polynomial size over an appropriate finitely generated group.
zurück / return