Sciweavers

Share
CC
2006
Springer

A tight lower bound for restricted pir protocols

9 years 10 months ago
A tight lower bound for restricted pir protocols
We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are 1-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 de Wolf while avoiding their use of quantum techniques. Keywords. Private information retrieval, lower bounds, privacy Subject classification. 68Q17,
Richard Beigel, Lance Fortnow, William I. Gasarch
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CC
Authors Richard Beigel, Lance Fortnow, William I. Gasarch
Comments (0)
books