Cryptology ePrint Archive: Report 2007/351
Available versions in chronological order
20070913:192944 (posted 13-Sep-2007 19:29:44 UTC)
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
Iftach Haitner and Jonathan J. Hoch and Gil Segev
20071212:162144 (posted 12-Dec-2007 16:21:44 UTC)
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
Iftach Haitner and Jonathan J. Hoch and Gil Segev
Publication Info: TCC '08
[
Cryptology ePrint archive
]