Paper 2014/851
Near Optimal Rate Homomorphic Encryption for Branching Programs
Aggelos Kiayias, Nikos Leonardos, Helger Lipmaa, Kateryna Pavlyk, and Qiang Tang
Abstract
We initiate the study of good rate homomorphic encryption schemes.
Based on previous work on securely evaluating (binary I/O) branching programs, we propose a leveled homomorphic encryption scheme
for {\em large-output} polynomial-size branching programs (which we call
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Preprint. MINOR revision.
- Keywords
- branching programsCPIRhomomorphic encryptionlower boundsPuiseux series
- Contact author(s)
- helger lipmaa @ gmail com
- History
- 2014-10-22: received
- Short URL
- https://ia.cr/2014/851
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/851, author = {Aggelos Kiayias and Nikos Leonardos and Helger Lipmaa and Kateryna Pavlyk and Qiang Tang}, title = {Near Optimal Rate Homomorphic Encryption for Branching Programs}, howpublished = {Cryptology {ePrint} Archive, Paper 2014/851}, year = {2014}, url = {https://eprint.iacr.org/2014/851} }