Skip to main content
SpringerLink
Log in

A tight lower bound for restricted pir protocols

  • Original Paper
  • Published:
computational complexity Aims and scope Submit manuscript

Abstract.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer and Information Sciences, Temple University, 1805 N. Broad St, Philadelphia, PA, 19122, U.S.A.

    Richard Beigel

  2. Department of Computer Science, University of Chicago, 1100 E. 58th St., Chicago, IL, 60637, U.S.A.

    Lance Fortnow

  3. Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, 20742, U.S.A.

    William Gasarch

Authors
  1. Richard Beigel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lance Fortnow
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. William Gasarch
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Richard Beigel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Beigel, R., Fortnow, L. & Gasarch, W. A tight lower bound for restricted pir protocols. comput. complex. 15, 82–91 (2006). https://doi.org/10.1007/s00037-006-0208-3

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00037-006-0208-3

Keywords.

Subject classification.

Search

Navigation