%0 Conference Paper %1 conf/tcc/HaitnerHS08 %A Haitner, Iftach %A Hoch, Jonathan J. %A Segev, Gil %B TCC %D 2008 %E Canetti, Ran %I Springer %K dblp %P 445-464 %T A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. %U http://dblp.uni-trier.de/db/conf/tcc/tcc2008.html#HaitnerHS08 %V 4948 %@ 978-3-540-78523-1

@inproceedings{conf/tcc/HaitnerHS08, added-at = {2019-06-16T00:00:00.000+0200}, author = {Haitner, Iftach and Hoch, Jonathan J. and Segev, Gil}, biburl = {https://www.bibsonomy.org/bibtex/2dcf6422222caf67459400a03c143699c/dblp}, booktitle = {TCC}, crossref = {conf/tcc/2008}, editor = {Canetti, Ran}, ee = {https://doi.org/10.1007/978-3-540-78524-8_25}, interhash = {d7e9500a3c451b704f6aabbff530dbd9}, intrahash = {dcf6422222caf67459400a03c143699c}, isbn = {978-3-540-78523-1}, keywords = {dblp}, pages = {445-464}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-06-18T11:41:13.000+0200}, title = {A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.}, url = {http://dblp.uni-trier.de/db/conf/tcc/tcc2008.html#HaitnerHS08}, volume = 4948, year = 2008 }