Ecem Ünal
ABSTRACT
We present improved and parallel versions of Lipmaa's computationally-private information retrieval (CPIR) protocol based on a additively-homomorphic cryptosystem. Lipmaa's original CPIR utilizes binary decision diagrams, in which non-sink nodes have two children nodes and the data items to be retrieved are placed in the sink nodes. In our scheme, we employ, instead, quadratic and octal trees, where non-sink nodes have four and eight child nodes, respectively. Using other tree forms, which does not change the asymptotic complexity, results in shallow trees by which we can obtain an implementation that is an order of magnitude faster than the original scheme. We also present a non-trivial parallel algorithm that takes advantage of shared-memory multi-core architectures. Finally, our scheme proves to be highly efficient in terms of bandwidth requirement, the amount of data being exchanged in a run of the CPIR protocol.
- Aguilar-Melchor, C., Gaborit, P. "A Lattice-Based Computationally-Efficient Private Information Retrieval Protocol", In WEWORC 2007, July 2007.Google Scholar
- Aguilar-Melchor, C., Crespin, B., Gaborit, P., Jolivet, V., Rousseau, P. "High-Speed PIR Computation on GPU", In SECURWARE'08, pp. 263--272, 2008.Google Scholar
- Ambainis, A., "Upper bound on the communication complexity of private information retrieval", In Proc. of the 24th ICALP, 1997. Google ScholarDigital Library
- Cachin, C., Micali, S., Stadler, M., "Computationally Private Information Retrieval with Polylogarithmic Communication", In EUROCRYPT 99, pp. 402--414, 1999. Google ScholarDigital Library
- Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M., "Private Information Retrieval", In FOCS 95: Proceedings of the 36th Annual Symposium on the Foundations of Computer Science, pp. 41--50, 1995. Google ScholarDigital Library
- Chor, B., Gilboa, N., "Computationally Private Information Retrieval", In 29th STOC, pp. 304--313, 1997. Google ScholarDigital Library
- Damgård, I., and Jurik, M., "A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System", In Public Key Cryptography, pp. 119--136. Springer Berlin Heidelberg, 2001. Google ScholarDigital Library
- Doröz, Y., Sunar, B., and Hammouri, G., "Bandwidth Efficient PIR from NTRU", In Workshop on Applied Homomorphic Cryptography and Encrypted Computing, WHAC'14, 2014.Google ScholarCross Ref
- Gentry, C., Ramzan, Z., "Single-Database Private Information Retrieval with Constant Communication Rate", In ICALP: Annual International Colloquium on Automata, Languages and Programming, pp. 803--815, 2005. Google ScholarDigital Library
- Ishai, Y., Kushilevitz, E., "Improved upper bounds on information-theoretic private information retrieval", In Proc. of the 31th ACM Sym. on TC, 1999. Google ScholarDigital Library
- Kushilevitz, E., Ostrovsky, R., "Replication Is Not Needed: Single Database, Computationally-Private Information Retrieval", FOCS '97, 1997. Google ScholarDigital Library
- Lipmaa, H., "First CPIR protocol with data-dependent computation", In Information, Security and Cryptology ICISC 2009, pp. 193--210. Springer Berlin Heidelberg, 2010. Google ScholarDigital Library
- Olumofin, F., and Goldberg, I., "Revisiting the computational practicality of private information retrieval", In Proceedings of the 15th international conference on Financial Cryptography and Data Security, pp. 158--172, 2012. Google ScholarDigital Library
- Ostrovsky, R., Shoup, V., "Private Information Storage", In 29th STOC, pp. 294--303, 1997. Google ScholarDigital Library
- Paillier, P., "Public-key cryptosystems based on composite degree residuosity classes", In Advances in cryptology, EUROCRYPT'99, pp. 223--238. Springer Berlin Heidelberg, 1999. Google ScholarDigital Library
- Rabin, M. O., "How to exchange secrets by oblivious transfer", Technical Report TR-81, Aiken Computation Laboratory, Harvard University, 1981. available at http://eprint.iacr.org/2005/187.Google Scholar
- Sion, R., Carbunar, B., "On the Computational Practicality of Private Information Retrieval", In NDSS07, 2007.Google Scholar
- Wiesner, S., "Conjugate coding", Sigact News, vol. 15, no. 1, pp. 78--88, 1983. Google ScholarDigital Library
Recommendations
Robust information-theoretic private information retrieval
SCN'02: Proceedings of the 3rd international conference on Security in communication networksA Private Information Retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database, such that the servers storing the database do not gain information on the identity of the item being retrieved. PIR protocols were ...
Robust Information-Theoretic Private Information Retrieval
An information-theoretic private information retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database replicated amongst several servers, such that each server gains absolutely no information on the identity of the ...
A survey of single-database private information retrieval: techniques and applications
PKC'07: Proceedings of the 10th international conference on Practice and theory in public-key cryptographyIn this paper we survey the notion of Single-Database Private Information Retrieval (PIR). The first Single-Database PIR was constructed in 1997 by Kushilevitz and Ostrovsky and since then Single-Database PIR has emerged as an important cryptographic ...
Comments