Optimal Rate Private Information Retrieval from Homomorphic Encryption
We consider the problem of minimizing the communication in single-database private information retrieval protocols in the case where the length of the data to be transmitted is large. We present first rate-optimal protocols for 1-out-of-n computationallyprivate information retrieval (CPIR), obliviou...
Main Authors: | Kiayias Aggelos, Leonardos Nikos, Lipmaa Helger, Pavlyk Kateryna, Tang Qiang |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2015-06-01
|
Series: | Proceedings on Privacy Enhancing Technologies |
Subjects: | |
Online Access: | https://doi.org/10.1515/popets-2015-0016 |
Similar Items
-
Improving the Efficiency of Homomorphic Encryption Schemes
by: Hu, Yin
Published: (2013) -
Towards practical fully homomorphic encryption
by: Alperin-Sheriff, Jacob
Published: (2015) -
Popping Bubbles: Cryptanalysis of Homomorphic Encryption
by: Steele, Corre
Published: (2016) -
Parameter Constraints on Homomorphic Encryption Over the Integers
by: Pabstel, Melanie Anne
Published: (2017) -
Secure Fully Homomorphic Authenticated Encryption
by: Jeongsu Kim, et al.
Published: (2021-01-01)