Paper 2003/025 Original: eprint.iacr.org/2003/025 ↗
Homomorphic 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 the logarithmic depth its encrypted simulation of a polynomial size over an appropriate finitely generated group.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2003-02-11: last updated
- 2003-02-11: published
- Short URL
- https://ia.cr/2003/025
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2003/025,
author = {D. Grigoriev. and I. Ponomarenko},
title = {Homomorphic public-key cryptosystems and encrypting boolean circuits},
howpublished = {Cryptology {ePrint} Archive, Paper 2003/025},
year = {2003},
url = {https://eprint.iacr.org/2003/025}
}