A tight lower bound for restricted pir protocols

We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are one bit long must ask questions that are at least n−2 bits long, which is nearly equal to the known n−1 upper bound. This improves upon the approximately 0.25n lower bound of Kerenidis and deWolf while avo...

Full description

Saved in:
Bibliographic Details
Published inComputational complexity Vol. 15; no. 1; pp. 82 - 91
Main Authors Beigel, Richard, Fortnow, Lance, Gasarch, William
Format Journal Article
LanguageEnglish
Published Heidelberg Springer Nature B.V 01.05.2006
Subjects
Computer science
Information retrieval
Lower bounds
Upper bounds
Online AccessGet full text
ISSN1016-3328
1420-8954
DOI10.1007/s00037-006-0208-3

Cover

More Information
Summary:We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are one bit long must ask questions that are at least n−2 bits long, which is nearly equal to the known n−1 upper bound. This improves upon the approximately 0.25n lower bound of Kerenidis and deWolf while avoiding their use of quantum techniques.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1016-3328
1420-8954
DOI:10.1007/s00037-006-0208-3