Iftach Haitner, Jonathan J. Hoch, Gil Segev. A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. In Ran Canetti, editor, Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. Volume 4948 of Lecture Notes in Computer Science, pages 445-464, Springer, 2008. [doi]
@inproceedings{HaitnerHS08,
title = {A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval},
author = {Iftach Haitner and Jonathan J. Hoch and Gil Segev},
year = {2008},
doi = {10.1007/978-3-540-78524-8_25},
url = {http://dx.doi.org/10.1007/978-3-540-78524-8_25},
tags = {information retrieval},
researchr = {https://researchr.org/publication/HaitnerHS08},
cites = {0},
citedby = {0},
pages = {445-464},
booktitle = {Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008},
editor = {Ran Canetti},
volume = {4948},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-78523-1},
}