A linear lower bound on the communication complexity of single-server private information retrieval

Iftach Haitner*, Jonathan J. Hoch, Gil Segev

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Fingerprint

Dive into the research topics of 'A linear lower bound on the communication complexity of single-server private information retrieval'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science