Part of the Lecture Notes in Computer Science book series (LNCS, volume 1256)
Upper bound on the communication complexity of private information retrieval
We construct a scheme for private information retrieval with k databases and communication complexity O(n1/(2k−1)).
Unable to display preview. Download preview PDF.
© Springer-Verlag 1997