Single-Database Private Information Retrieval with Constant Communication Rate

  • Craig Gentry
  • Zulfikar Ramzan
Conference paper

DOI: 10.1007/11523468_65

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3580)
Cite this paper as:
Gentry C., Ramzan Z. (2005) Single-Database Private Information Retrieval with Constant Communication Rate. In: Caires L., Italiano G.F., Monteiro L., Palamidessi C., Yung M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg

Abstract

We present a single-database private information retrieval (PIR) scheme with communication complexity \({\mathcal O}(k+d)\), where k ≥ log n is a security parameter that depends on the database size n and d is the bit-length of the retrieved database block. This communication complexity is better asymptotically than previous single-database PIR schemes. The scheme also gives improved performance for practical parameter settings whether the user is retrieving a single bit or very large blocks. For large blocks, our scheme achieves a constant “rate” (e.g., 0.2), even when the user-side communication is very low (e.g., two 1024-bit numbers). Our scheme and security analysis is presented using general groups with hidden smooth subgroups; the scheme can be instantiated using composite moduli, in which case the security of our scheme is based on a simple variant of the “Φ-hiding” assumption by Cachin, Micali and Stadler [2].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Craig Gentry
    • 1
  • Zulfikar Ramzan
    • 1
  1. 1.DoCoMo Communications Laboratories USA, Inc 

Personalised recommendations