Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval

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]

Abstract

Abstract is missing.