Session 9: Algorithms II

Automata, Languages and Programming

Volume 1256 of the series Lecture Notes in Computer Science pp 401-407


Upper bound on the communication complexity of private information retrieval

  • Andris AmbainisAffiliated withInstitute of Mathematics and Computer Science, University of Latvia

* Final gross prices may vary according to local VAT.

Get Access


We construct a scheme for private information retrieval with k databases and communication complexity O(n 1/(2k−1) ).