Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Jean-François Raymond. Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval. In 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings. pages 261-270, IEEE Computer Society, 2002. [doi]
@inproceedings{BeimelIKR02,
title = {Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval},
author = {Amos Beimel and Yuval Ishai and Eyal Kushilevitz and Jean-François Raymond},
year = {2002},
doi = {10.1109/SFCS.2002.1181949},
url = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181949},
tags = {information retrieval},
researchr = {https://researchr.org/publication/BeimelIKR02},
cites = {0},
citedby = {0},
pages = {261-270},
booktitle = {43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings},
publisher = {IEEE Computer Society},
isbn = {0-7695-1822-2},
}