Two New Efficient PIR-Writing Protocols

  • Helger Lipmaa
  • Bingsheng Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6123)

Abstract

Assume that a client outsources his database to a remote storage-provider (the server), so that for privacy reasons, the client’s database is encrypted by his secret key. During a PIR-writing protocol, the client updates one element of the encrypted database without revealing to the semi-honest server which element was updated and, of course, to which value. The best previous PIR-writing protocols had square-root communication complexity. In this paper, we propose two new PIR-writing protocols. The first one can be based on (say) the Damgård-Jurik additively homomorphic public-key cryptosystem, and it has (amortized) polylogarithmic communication for a limited number of updates. The second one is based on a fully-homomorphic public-key cryptosystem, a much stronger primitive, but it achieves optimal logarithmic communication.

Keywords

Cryptocomputing binary decision diagram circuits fully-homomorphic encryption PIR-writing PrivateBDD 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Boneh, D., Goh, E.J., Nissim, K.: Evaluating 2-DNF Formulas on Ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325–341. Springer, Heidelberg (2005)Google Scholar
  2. 2.
    Boneh, D., Kushilevitz, E., Ostrovsky, R., Skeith III, W.E.: Public Key Encryption That Allows PIR Queries. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 50–67. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Chandran, N., Ostrovsky, R., Skeith III, W.E.: Public-Key Encryption with Efficient Amortized Updates. Tech. Rep. 2008/429, International Association for Cryptologic Research (2008), http://eprint.iacr.org/2008/429
  4. 4.
    Damgård, I., Jurik, M.: A Generalisation, a Simplification and Some Applications of Paillier’s Probabilistic Public-Key System. In: Kim, K. (ed.) PKC 2001. LNCS, vol. 1992, pp. 119–136. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully Homomorphic Encryption over the Integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, Springer, Heidelberg (2010)CrossRefGoogle Scholar
  6. 6.
    Gentry, C.: A Fully Homomorphic Encryption Scheme. Ph.D. thesis, Stanford (September 2009)Google Scholar
  7. 7.
    Gentry, C.: Fully Homomorphic Encryption Using Ideal Lattices. In: Mitzenmacher, M. (ed.) STOC 2009, May 31-June 2, pp. 169–178. ACM Press, Bethesda (2009)CrossRefGoogle Scholar
  8. 8.
    Gentry, C., Ramzan, Z.: Single-Database Private Information Retrieval with Constant Communication Rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 803–815. Springer, Heidelberg (2005)Google Scholar
  9. 9.
    Ishai, Y., Paskin, A.: Evaluating Branching Programs on Encrypted Data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 575–594. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  10. 10.
    Lipmaa, H.: An Oblivious Transfer Protocol with Log-Squared Communication. In: Zhou, J., López, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 314–328. Springer, Heidelberg (2005)Google Scholar
  11. 11.
    Lipmaa, H.: First CPIR Protocol with Data-Dependent Computation. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol. 5984. Springer, Heidelberg (2009)Google Scholar
  12. 12.
    Ostrovsky, R.: Efficient Computation on Oblivious RAMs. In: STOC 1990, Baltimore, Maryland, USA, May 14-16, pp. 514–523 (1990)Google Scholar
  13. 13.
    Ostrovsky, R., Shoup, V.: Private Information Storage. In: STOC 1997, pp. 294–303 (1997)Google Scholar
  14. 14.
    Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)Google Scholar
  15. 15.
    Wegener, I.: Branching Programs and Binary Decision Diagrams: Theory and Applications. Monographs on Discrete Mathematics and Applications. Society for Industrial Mathematics (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Helger Lipmaa
    • 1
    • 2
  • Bingsheng Zhang
    • 1
    • 3
  1. 1.Cybernetica ASEstonia
  2. 2.Tallinn UniversityEstonia
  3. 3.University of TartuEstonia

Personalised recommendations