Lecture notes in computer science

Computationally Private Information Retrieval with Polylogarithmic Communication

Christian Cachin, Silvio M. Micali, Markus A. Stadler

Published Jan 1, 1999• 582 citations

Related papers

Multi-query Computationally-Private Information Retrieval with Constant Communication Rate

Jens Groth, Aggelos Kiayias, Helger Lipmaa

Upper bound on the communication complexity of private information retrieval

Andris Ambainis

Lower Bounds for Communication Complexity of Private Information Retrieval

利哉伊東, Toshiya Itoh

Single Database Private Information Retrieval with Logarithmic Communication

Yan-Cheng Chang

On Lower Bounds for the Communication Complexity of Private Information Retrieval

Toshiya Itoh

A Study of Computational Private Information Retrieval Schemes and Oblivious Transfer

Valentina Settimi