Date: 08 Jun 2005

Upper bound on the communication complexity of private information retrieval

* 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) ).

Computer Science Division, University of California at Berkeley.
The author was supported by Latvia Science Council Grant 96.0282 and scholarship “SWH Izglītībai, Zinātnei un Kultūrai” from Latvia Education Foundation