Paper 2015/1044 Original: eprint.iacr.org/2015/1044 ↗
Homomorphic evaluation requires depth
Abstract
We show that homomorphic evaluation of any non-trivial functionality of sufficiently many inputs with respect to any CPA secure homomorphic encryption scheme cannot be implemented by circuits of polynomial size and constant depth, i.e., in the class AC0. In contrast, we observe that there exist ordinary public-key encryption schemes of quasipolynomial security in AC0 assuming noisy parities are exponentially hard to learn. We view this as evidence that homomorphic evaluation is inherently more complex than basic operations in encryption schemes.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2016-04-13: last updated
- 2015-10-28: published
- Short URL
- https://ia.cr/2015/1044
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2015/1044,
author = {Andrej Bogdanov and Chin Ho Lee},
title = {Homomorphic evaluation requires depth},
howpublished = {Cryptology {ePrint} Archive, Paper 2015/1044},
year = {2015},
url = {https://eprint.iacr.org/2015/1044}
}