[HHS08] A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval

Authors: Iftach Haitner, Jonathan J. Hoch, Gil Segev | Venue: TCC 2008 | Source

Abstract

TODO — abstract.

BibTeX

Copy

@Inproceedings{TCC:HaiHocSeg08,
  author = {Iftach Haitner and Jonathan J. Hoch and Gil Segev},
  title = {A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval},
  pages = {445--464},
  editor = {Ran Canetti},
  booktitle = {TCC~2008: 5th Theory of Cryptography Conference},
  volume = {4948},
  series = {Lecture Notes in Computer Science},
  address = {San Francisco, CA, USA},
  month = {mar~19--21},
  publisher = {Springer Berlin Heidelberg, Germany},
  year = {2008},
  doi = {10.1007/978-3-540-78524-8_25},
}