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...
Saved in:
| Published in | Computational complexity Vol. 15; no. 1; pp. 82 - 91 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Heidelberg
Springer Nature B.V
01.05.2006
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1016-3328 1420-8954 |
| DOI | 10.1007/s00037-006-0208-3 |
Cover
| 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. |
|---|---|
| AbstractList | 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. |
| Author | Beigel, Richard Gasarch, William Fortnow, Lance |
| Author_xml | – sequence: 1 givenname: Richard surname: Beigel fullname: Beigel, Richard – sequence: 2 givenname: Lance surname: Fortnow fullname: Fortnow, Lance – sequence: 3 givenname: William surname: Gasarch fullname: Gasarch, William |
| BookMark | eNp9kD1PwzAQhi1UJNrCD2CLxGw45xx_jFUFFKkSC8yW49iQKsTFdoX496QqEwPT3fA-956eBZmNcfSEXDO4ZQDyLgMASgogKNSgKJ6ROeM1UKUbPpt2YIIi1uqCLHLeAbBGIZ8TWFWlf3sv1RC_fKraeBi7KsRUJZ9L6l3xXbXvU7VPsUQXh3xJzoMdsr_6nUvy-nD_st7Q7fPj03q1pQ5RF9qCakAyjo0PApXTUlkMXVBct85ray2zXKBsuYRGa4ZSdSqAE52X6HWDS3Jzujs1fx6mZ8wuHtI4VZpaCM6F4kxNKXlKuRRzTj4Y1xdb-jiWZPvBMDBHPeakx0x6zFGPwYlkf8h96j9s-v6H-QFFqWfO |
| CitedBy_id | crossref_primary_10_1007_s10462_010_9161_2 crossref_primary_10_1145_1326554_1326555 crossref_primary_10_1137_06065773X crossref_primary_10_1145_3688824 crossref_primary_10_1587_transinf_E93_D_263 |
| ContentType | Journal Article |
| Copyright | Birkhäuser Verlag, Basel 2006. |
| Copyright_xml | – notice: Birkhäuser Verlag, Basel 2006. |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s00037-006-0208-3 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1420-8954 |
| EndPage | 91 |
| ExternalDocumentID | 10_1007_s00037_006_0208_3 |
| GroupedDBID | -Y2 -~C .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 2.D 203 28- 29F 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYXX AAYZH ABAKF ABBBX ABBRH ABBXA ABDBE ABDZT ABECU ABFSG ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSTC ACZOJ ADHHG ADHIR ADHKG ADIMF ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFEXP AFGCZ AFHIU AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG CITATION COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ IHE IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- MBV N2Q N9A NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P9O PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE T13 T16 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 ZMTXR ~EX ABRTQ |
| ID | FETCH-LOGICAL-c339t-b085071435ef638c978a3fdf849bce9aaa1a4637b4705991378d8f0c6de73e953 |
| ISSN | 1016-3328 |
| IngestDate | Tue Sep 09 14:50:36 EDT 2025 Tue Jul 01 01:36:14 EDT 2025 Thu Apr 24 22:57:26 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | https://www.springer.com/tdm |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c339t-b085071435ef638c978a3fdf849bce9aaa1a4637b4705991378d8f0c6de73e953 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2664468418 |
| PQPubID | 2044003 |
| PageCount | 10 |
| ParticipantIDs | proquest_journals_2664468418 crossref_citationtrail_10_1007_s00037_006_0208_3 crossref_primary_10_1007_s00037_006_0208_3 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2006-05-01 |
| PublicationDateYYYYMMDD | 2006-05-01 |
| PublicationDate_xml | – month: 05 year: 2006 text: 2006-05-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Heidelberg |
| PublicationPlace_xml | – name: Heidelberg |
| PublicationTitle | Computational complexity |
| PublicationYear | 2006 |
| Publisher | Springer Nature B.V |
| Publisher_xml | – name: Springer Nature B.V |
| SSID | ssj0015834 |
| Score | 1.7754304 |
| Snippet | 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,... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 82 |
| SubjectTerms | Computer science Information retrieval Lower bounds Upper bounds |
| Title | A tight lower bound for restricted pir protocols |
| URI | https://www.proquest.com/docview/2664468418 |
| Volume | 15 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1JS8QwFA6jXvQgrriMkoMnh0o7SdvkOIoLop4UvJVslQEZxVYQf70vSzuLC-qllNCGpO_ry0ve8iF0UArODWdlZLTKIpooFUn7PwI-Eh1LpYm22cjXN9nFHb28T-87nauJqKXXWh6p9y_zSv4jVWgDudos2T9Itu0UGuAe5AtXkDBcfyXjQa-2e-veo6U660nLkOTCBi3fBug3a0w-D19sDFb9BAKvJi1RT-fQHAW6yHLzNqzH-Q1m-OA9-BO594HPox55j9DVJGTORSUCsVQ4xJk9UWji94ISBDMwIiQkbRvfRmGbybgv-NxqzvQTQrwa9HxCYUH1bFyfVLWPzqhcBZzIjaJvj2rH61Lji59ZrtogwrbgsuuicAF60EVB5tBCP8-t035hcHZ8fNN6lVLmowya-TVe7tgVlZ0ex7SdMr1MO9vjdgUth00DHngErKKOGa2hpeu24m61juIBdljADgvYYQEDFvAYCxiwgFssbKC7s9Pbk4sosGFEihBeR9IWF7Rs9akpQWkq2P4LUuqSUS6V4UKIRNCM5JLmtuZOQnKmWRmrTJucGJ6STTQ_ehqZLYQlZTGP85LSjFOjOeurVPa1ESzNZUbLbRQ3cy9UKBVvGUsei2-_-TY6bF959nVSfnq423zQIvxOVQGWIoyH0YTt_KWvXbQ4xnAXzdcvr2YP7MRa7gfxfwCdwWKg |
| linkProvider | Library Specific Holdings |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+tight+lower+bound+for+restricted+pir+protocols&rft.jtitle=Computational+complexity&rft.au=Beigel%2C+Richard&rft.au=Fortnow%2C+Lance&rft.au=Gasarch%2C+William&rft.date=2006-05-01&rft.issn=1016-3328&rft.eissn=1420-8954&rft.volume=15&rft.issue=1&rft.spage=82&rft.epage=91&rft_id=info:doi/10.1007%2Fs00037-006-0208-3&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00037_006_0208_3 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1016-3328&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1016-3328&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1016-3328&client=summon |