[BIKR02] Breaking the $O(n^{1/(2k-1)})$ Barrier for Information-Theoretic Private Information Retrieval

Authors: Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Jean-François Raymond | Venue: FOCS 2002 | Source

Abstract

TODO — abstract.

BibTeX

Copy

@Inproceedings{FOCS:BIKR02,
  author = {Amos Beimel and Yuval Ishai and Eyal Kushilevitz and Jean-Fran{\c c}ois Raymond},
  title = {Breaking the {$O(n^{1/(2k-1)})$} Barrier for Information-Theoretic Private Information Retrieval},
  pages = {261--270},
  booktitle = {43rd Annual Symposium on Foundations of Computer Science},
  address = {Vancouver, BC, Canada},
  month = {nov~16--19},
  publisher = {{IEEE} Computer Society Press},
  year = {2002},
  doi = {10.1109/SFCS.2002.1181949},
}