Computationally private information retrieval with polylogarithmic communication

  • Authors:
  • Christian Cachin;Silvio Micali;Markus Stadler

  • Affiliations:
  • IBM Zurich Research Laboratory, Rüschlikon, Switzerland;Laboratory for Computer Science, MIT, Cambridge, MA;Crypto AG, Zug, Switzerland

  • Venue:
  • EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
  • Year:
  • 1999

Quantified Score

Hi-index 0.02

Visualization

Abstract

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.