Homomorphic public-key cryptosystems and encrypting boolean circuits

Simple item page
dc.creatorGrigoriev, Dima
dc.creatorPonomarenko, Ilia
dc.date2003-01-22
dc.date2003-02-28
dc.date.accessioned2026-07-07T03:19:22Z
dc.date.available2026-07-07T03:19:22Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/cs/0301022
dc.identifierhttp://arxiv.org/abs/cs/0301022
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31435
dc.subjectCryptography and Security
dc.subjectE.3.3
dc.titleHomomorphic public-key cryptosystems and encrypting boolean circuits
dc.typetext

Files

Collections

arXiv