Computationally Private Information Retrieval with Polylogarithmic Communication

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.

• Type: Conference
• Year: 1999
• Where: EUROCRYPT
• Authors: Christian Cachin, Silvio Micali, Markus Stadler
• Keywords: Cryptology, EUROCRYPT 1999, Polylogarithmic Communication Complexity, Private Information Retrieval Scheme, Reasonable Intractability Assumption