A tight lower bound for restricted pir protocols
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
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.
- A tight lower bound for restricted pir protocols
Volume 15, Issue 1 , pp 82-91
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Private information retrieval
- lower bounds
- Industry Sectors
- Author Affiliations
- 1. Department of Computer and Information Sciences, Temple University, 1805 N. Broad St, Philadelphia, PA, 19122, U.S.A.
- 2. Department of Computer Science, University of Chicago, 1100 E. 58th St., Chicago, IL, 60637, U.S.A.
- 3. Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, 20742, U.S.A.