Computationally Private Information Retrieval with Polylogarithmic Communication

  • Christian Cachin
  • Silvio Micali
  • Markus Stadler
Conference paper

DOI: 10.1007/3-540-48910-X_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1592)
Cite this paper as:
Cachin C., Micali S., Stadler M. (1999) Computationally Private Information Retrieval with Polylogarithmic Communication. In: Stern J. (eds) Advances in Cryptology — EUROCRYPT ’99. EUROCRYPT 1999. Lecture Notes in Computer Science, vol 1592. Springer, Berlin, Heidelberg


We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable intractability assumption, which we call the Φ-Hiding Assumption (ΦHA): essentially the difficulty of deciding whether a small prime divides Φ(m), where m is a composite integer of unknown factorization.


Integer factorization Euler’s function Φ-hiding assumption Private information retrieval 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Christian Cachin
    • 1
  • Silvio Micali
    • 2
  • Markus Stadler
    • 3
  1. 1.IBM Zurich Research LaboratoryRüschlikonSwitzerland
  2. 2.Laboratory for Computer ScienceMITCambridgeUSA
  3. 3.Crypto AGZugSwitzerland

Personalised recommendations