International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval

Authors:
Iftach Haitner
Jonathan J. Hoch
Gil Segev
Download:
DOI: 10.1007/978-3-540-78524-8_25
URL: https://iacr.org/archive/tcc2008/49480440/49480440.pdf
Search ePrint
Search Google
Conference: TCC 2008
BibTeX
@inproceedings{tcc-2008-14357,
  title={A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval},
  booktitle={Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008.},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={4948},
  pages={445-464},
  url={https://iacr.org/archive/tcc2008/49480440/49480440.pdf},
  doi={10.1007/978-3-540-78524-8_25},
  author={Iftach Haitner and Jonathan J. Hoch and Gil Segev},
  year=2008
}