The Capacity of Private Information Retrieval From Coded Databases
We consider the problem of private information retrieval (PIR) over a distributed storage system. The storage system consists of N non-colluding databases, each storing an MDS-coded version of M messages. In the PIR problem, the user wishes to retrieve one of the available messages without revealing...
Saved in:
| Published in: | IEEE transactions on information theory Vol. 64; no. 3; pp. 1945 - 1956 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
01.03.2018
|
| Subjects: | |
| ISSN: | 0018-9448, 1557-9654 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We consider the problem of private information retrieval (PIR) over a distributed storage system. The storage system consists of N non-colluding databases, each storing an MDS-coded version of M messages. In the PIR problem, the user wishes to retrieve one of the available messages without revealing the message identity to any individual database. We derive the information-theoretic capacity of this problem, which is defined as the maximum number of bits of the desired message that can be privately retrieved per one bit of downloaded information. We show that the PIR capacity in this case is C = (1 + K/N + K2/N2 + ⋯ + KM-1/NM-1)-1 = (1 + Rc + Rc2 + ⋯ + RcM-1)-1 = (1 - Rc)/(1 - RcM), where Rc is the rate of the (N, K) MDS code used. The capacity is a function of the code rate and the number of messages only regardless of the explicit structure of the storage code. The result implies a fundamental tradeoff between the optimal retrieval cost and the storage cost when the storage code is restricted to the class of MDS codes. The result generalizes the achievability and converse results for the classical PIR with replicated databases to the case of MDS-coded databases. |
|---|---|
| AbstractList | We consider the problem of private information retrieval (PIR) over a distributed storage system. The storage system consists of N non-colluding databases, each storing an MDS-coded version of M messages. In the PIR problem, the user wishes to retrieve one of the available messages without revealing the message identity to any individual database. We derive the information-theoretic capacity of this problem, which is defined as the maximum number of bits of the desired message that can be privately retrieved per one bit of downloaded information. We show that the PIR capacity in this case is C = (1 + K/N + K2/N2 + ⋯ + KM-1/NM-1)-1 = (1 + Rc + Rc2 + ⋯ + RcM-1)-1 = (1 - Rc)/(1 - RcM), where Rc is the rate of the (N, K) MDS code used. The capacity is a function of the code rate and the number of messages only regardless of the explicit structure of the storage code. The result implies a fundamental tradeoff between the optimal retrieval cost and the storage cost when the storage code is restricted to the class of MDS codes. The result generalizes the achievability and converse results for the classical PIR with replicated databases to the case of MDS-coded databases. |
| Author | Banawan, Karim Ulukus, Sennur |
| Author_xml | – sequence: 1 givenname: Karim orcidid: 0000-0001-8547-5010 surname: Banawan fullname: Banawan, Karim – sequence: 2 givenname: Sennur orcidid: 0000-0002-8219-8190 surname: Ulukus fullname: Ulukus, Sennur |
| BookMark | eNp1kM1LAzEQxYNUsK3ePQY875qk-dgcdbVaKCiynkN2dxa3tJuapIX-96a2J8HT8Jj3Zni_CRoNbgCEbinJKSX6vlpUOSO0yJnSVGt-gcZUCJVpKfgIjUlaZZrz4gpNQlglyQVlY_RYfQEu7dY2fTxg1-F33-9tBLwYOuc3NvZuwB8QfQ97u8Zz7za4dC20-MlGW9sA4RpddnYd4OY8p-hz_lyVr9ny7WVRPiyzZjZTMWNaQNMKqHkti4K1SnZcFAp4q4C1taS60ZxSUFpqXlBdS4CGqVqrNrmaYjZFd6e7W---dxCiWbmdH9JLwwiRLPXhIrnIydV4F4KHzmx9v7H-YCgxR1ImkTJHUuZMKkXkn0iC8ds8etuv_w_-AAF1bdk |
| CitedBy_id | crossref_primary_10_1109_JSAC_2022_3142366 crossref_primary_10_1109_TIT_2019_2954336 crossref_primary_10_1109_TVT_2018_2876683 crossref_primary_10_1109_JSAC_2022_3142363 crossref_primary_10_1109_TIT_2019_2953883 crossref_primary_10_1109_TIT_2020_2964762 crossref_primary_10_1016_j_jisa_2021_102830 crossref_primary_10_1109_JSAC_2022_3142362 crossref_primary_10_1002_cpe_5284 crossref_primary_10_1109_JSAC_2022_3142360 crossref_primary_10_1109_TIT_2021_3136583 crossref_primary_10_1109_TIT_2021_3124925 crossref_primary_10_1109_TIFS_2019_2937634 crossref_primary_10_1109_TCOMM_2020_3010988 crossref_primary_10_1109_TIT_2021_3102177 crossref_primary_10_1109_TIT_2019_2900313 crossref_primary_10_1109_TCOMM_2021_3125056 crossref_primary_10_1109_JSAC_2022_3142375 crossref_primary_10_3390_e23111461 crossref_primary_10_1109_TIT_2020_3023016 crossref_primary_10_1109_TIT_2019_2957577 crossref_primary_10_1007_s11432_018_9538_4 crossref_primary_10_1109_TIT_2021_3064827 crossref_primary_10_1109_TIT_2024_3388597 crossref_primary_10_1109_TIT_2021_3112952 crossref_primary_10_1109_TIFS_2025_3587192 crossref_primary_10_1109_TIT_2018_2884891 crossref_primary_10_1109_TIFS_2019_2928483 crossref_primary_10_1109_TVT_2021_3083603 crossref_primary_10_1109_ACCESS_2019_2946288 crossref_primary_10_1109_ACCESS_2019_2927329 crossref_primary_10_1109_TCOMM_2022_3168079 crossref_primary_10_1109_TIFS_2020_2972166 crossref_primary_10_3390_info14010044 crossref_primary_10_3390_e26030244 crossref_primary_10_1109_TIT_2022_3156276 crossref_primary_10_3390_e27080828 crossref_primary_10_1109_TIT_2019_2963872 crossref_primary_10_1016_j_ins_2020_07_006 crossref_primary_10_1109_TIT_2020_2977058 crossref_primary_10_1109_TIT_2025_3541551 crossref_primary_10_1109_TIT_2022_3140890 crossref_primary_10_1109_TIFS_2019_2940895 crossref_primary_10_1109_JSEN_2023_3252635 crossref_primary_10_1109_JSAC_2022_3142352 crossref_primary_10_1109_JSAC_2022_3142358 crossref_primary_10_1109_TIT_2018_2871050 crossref_primary_10_1109_TIT_2020_3013152 crossref_primary_10_1155_2020_8859213 crossref_primary_10_1109_TIT_2021_3120316 crossref_primary_10_1109_TIFS_2020_2981282 crossref_primary_10_1109_TIT_2021_3077269 crossref_primary_10_1109_TIT_2022_3165400 crossref_primary_10_1109_TIT_2018_2848977 crossref_primary_10_1109_TIT_2023_3336792 crossref_primary_10_1109_TIT_2018_2883302 crossref_primary_10_3390_e23101287 crossref_primary_10_1109_TIT_2021_3126865 crossref_primary_10_3390_e27090975 crossref_primary_10_1109_TIT_2021_3100476 crossref_primary_10_1109_TIT_2020_2977919 crossref_primary_10_1109_TIT_2021_3107944 crossref_primary_10_1109_TIT_2018_2890285 crossref_primary_10_1109_TIT_2025_3551697 crossref_primary_10_1109_TIT_2020_2977082 crossref_primary_10_1109_TIT_2020_3022515 crossref_primary_10_1109_TIFS_2019_2925723 crossref_primary_10_1109_TIT_2019_2942311 crossref_primary_10_1109_TIFS_2022_3203320 crossref_primary_10_1109_TIT_2020_2977073 crossref_primary_10_1007_s00200_021_00508_5 crossref_primary_10_1109_TIT_2019_2936023 crossref_primary_10_1109_TIT_2020_3014973 crossref_primary_10_1109_TIT_2018_2878034 crossref_primary_10_1109_TIT_2023_3292187 crossref_primary_10_1007_s11042_024_18783_y crossref_primary_10_1109_TCOMM_2019_2906229 crossref_primary_10_1109_MBITS_2023_3322972 crossref_primary_10_1109_TCOMM_2022_3168282 crossref_primary_10_1109_TIT_2023_3344717 crossref_primary_10_1109_TCOMM_2021_3091612 crossref_primary_10_1109_TIT_2018_2869154 crossref_primary_10_1109_TIT_2018_2888494 crossref_primary_10_1109_JSAC_2022_3142296 crossref_primary_10_1109_TIT_2019_2918207 crossref_primary_10_1109_TSC_2022_3162285 crossref_primary_10_1109_JSAC_2022_3142293 crossref_primary_10_1109_TIT_2021_3078851 crossref_primary_10_1109_TIT_2019_2935440 crossref_primary_10_1109_TIT_2025_3559736 crossref_primary_10_1109_TIT_2020_3029314 crossref_primary_10_1109_MBITS_2024_3368349 crossref_primary_10_1109_TIT_2024_3506990 crossref_primary_10_1002_itl2_243 crossref_primary_10_1109_TIFS_2020_3003572 crossref_primary_10_1109_TIFS_2021_3050068 crossref_primary_10_1109_JSAC_2022_3142301 crossref_primary_10_1140_epjqt_s40507_024_00266_6 crossref_primary_10_3390_info10120372 crossref_primary_10_1109_TCOMM_2020_2980833 crossref_primary_10_1109_TIT_2019_2916079 crossref_primary_10_1109_TIFS_2023_3249565 crossref_primary_10_1109_TCOMM_2023_3236385 crossref_primary_10_1109_TCOMM_2021_3054764 crossref_primary_10_1109_TIT_2019_2933011 crossref_primary_10_1109_TIT_2018_2828310 crossref_primary_10_1109_TIT_2019_2903206 crossref_primary_10_1109_TIT_2024_3397642 crossref_primary_10_1109_TIT_2025_3581850 crossref_primary_10_1109_TIT_2025_3565288 crossref_primary_10_1109_JSAC_2018_2844940 crossref_primary_10_1016_j_ffa_2024_102421 crossref_primary_10_1109_TIFS_2022_3220034 crossref_primary_10_1109_TIT_2021_3087425 crossref_primary_10_1109_TIFS_2022_3166667 crossref_primary_10_3390_info10090265 crossref_primary_10_1109_TIT_2024_3363133 crossref_primary_10_1007_s11227_020_03594_3 crossref_primary_10_1016_j_procs_2023_11_038 crossref_primary_10_1109_TIT_2020_3011053 crossref_primary_10_1109_TIT_2020_3015818 crossref_primary_10_1109_TIT_2019_2948845 crossref_primary_10_1109_TIFS_2022_3147638 crossref_primary_10_1109_TIT_2018_2880235 crossref_primary_10_1007_s11042_022_12371_8 crossref_primary_10_1007_s10623_019_00640_x crossref_primary_10_1109_TIT_2020_3015812 crossref_primary_10_1109_TIT_2021_3085363 crossref_primary_10_1109_TIT_2021_3125006 |
| Cites_doi | 10.1109/ISIT.2016.7541531 10.1109/ISIT.2016.7541361 10.1109/JPROC.2010.2096170 10.1109/JSTSP.2012.2187877 10.1109/ISIT.2014.6874954 10.1109/ICC.2017.7997393 10.1109/TIT.2017.2689028 10.1109/ISIT.2015.7282975 10.1145/293347.293350 10.1145/1721654.1721674 10.1007/978-3-540-71677-8_26 10.1109/GLOCOMW.2016.7849060 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018 |
| DBID | AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/TIT.2018.2791994 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1557-9654 |
| EndPage | 1956 |
| ExternalDocumentID | 10_1109_TIT_2018_2791994 |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AASAJ AAWTH AAYXX ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CITATION CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK 7SC 7SP 8FD AARMG ABAZT JQ2 L7M L~C L~D RIG |
| ID | FETCH-LOGICAL-c337t-295ecd5eb4b6882d76f4587e4d7e2db619c9411e79694819b6eec27b97d87ec83 |
| ISICitedReferencesCount | 250 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000425665200031&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9448 |
| IngestDate | Sun Jun 29 12:12:20 EDT 2025 Sat Nov 29 03:31:39 EST 2025 Tue Nov 18 22:18:27 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c337t-295ecd5eb4b6882d76f4587e4d7e2db619c9411e79694819b6eec27b97d87ec83 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-8547-5010 0000-0002-8219-8190 |
| PQID | 2006251245 |
| PQPubID | 36024 |
| PageCount | 12 |
| ParticipantIDs | proquest_journals_2006251245 crossref_primary_10_1109_TIT_2018_2791994 crossref_citationtrail_10_1109_TIT_2018_2791994 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-03-01 |
| PublicationDateYYYYMMDD | 2018-03-01 |
| PublicationDate_xml | – month: 03 year: 2018 text: 2018-03-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on information theory |
| PublicationYear | 2018 |
| Publisher | The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref12 ref15 ref11 ref1 cover (ref17) 2012 sun (ref10) 2016 sun (ref16) 2016 ref8 ref7 ref9 ref4 ref3 ref6 ref5 gasarch (ref2) 2004; 82 fazeli (ref14) 2015 |
| References_xml | – ident: ref5 doi: 10.1109/ISIT.2016.7541531 – ident: ref9 doi: 10.1109/ISIT.2016.7541361 – ident: ref12 doi: 10.1109/JPROC.2010.2096170 – year: 2015 ident: ref14 publication-title: PIR with low storage overhead Coding instead of replication – ident: ref8 doi: 10.1109/JSTSP.2012.2187877 – ident: ref13 doi: 10.1109/ISIT.2014.6874954 – ident: ref15 doi: 10.1109/ICC.2017.7997393 – ident: ref7 doi: 10.1109/TIT.2017.2689028 – ident: ref6 doi: 10.1109/ISIT.2015.7282975 – ident: ref1 doi: 10.1145/293347.293350 – ident: ref4 doi: 10.1145/1721654.1721674 – volume: 82 start-page: 72 year: 2004 ident: ref2 article-title: A survey on private information retrieval publication-title: Bull EATCS – year: 2016 ident: ref16 publication-title: Multiround private information retrieval Capacity and storage overhead – year: 2016 ident: ref10 publication-title: The Capacity of Robust Private Information Retrieval with Colluding Databases – year: 2012 ident: ref17 publication-title: Elements of Information Theory – ident: ref3 doi: 10.1007/978-3-540-71677-8_26 – ident: ref11 doi: 10.1109/GLOCOMW.2016.7849060 |
| SSID | ssj0014512 |
| Score | 2.675293 |
| Snippet | We consider the problem of private information retrieval (PIR) over a distributed storage system. The storage system consists of N non-colluding databases,... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 1945 |
| SubjectTerms | Codes Information retrieval Information theory Messages Storage |
| Title | The Capacity of Private Information Retrieval From Coded Databases |
| URI | https://www.proquest.com/docview/2006251245 |
| Volume | 64 |
| WOSCitedRecordID | wos000425665200031&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZKywEO0BYqCqXyoRcOaRPnYc8RCoiqUoXEVuotSmyvVNFmq90s9Ocz40c2rQDRA5doZWVns54v4xmP5xvGDoyQGtImT0xDLcxUIfCVqtIEUp0ZIgCxbeOaTcizM3VxATGju3DtBGTXqdtbuPmvqsYxVDaVzj5A3YNQHMDPqHS8otrx-s-KP8YlUIfDFl_n1MCMjkgOhYo4qdRHC38VHdfZNRoFg37nx6ZvaFFbjB1WCgapj0RsKu6yC5cjUX0s7g8bol3z0--pnmIUfh3Hz6-W35cOMt8s1SaPNxsytTptFQ0ojkHhyTEPbbCZpUyg8lzQ0ah6avIAnnxkITPw9JFhtaVyxd9bckeEOjmZ0PE7dSgkEIvxatWKmfp7i9lwxNAFNynUKKEmCXWQ8IhtCFmC8qV-Q8KpKDNPLB_-X8xop3B0_xnuejB3F3DnlUw22bMQTvD3HgZbbM122-x5bNXBg-XeZk9HvJMv2AfECI8Y4bMpDxjhI4zwASOcMMIdRviAkZfs_POnyfGXJDTTSHSeyz4RUFptStsWbYVRlZHVtCiVtIWRVpgW42gNRZZZCRUR-EBbWauFbEEavEurfIetd7POvmLctpAaiX6nROfQKJzMdNoITTndVlap2GVHcYJqHZjmqeHJVf0npeyyd8M3bjzLyl_u3YtzXofXbkHNVCvy1Ivy9QNEvWFPViDfY-v9fGnfssf6R3-5mO87gPwCF3h49A |
| linkProvider | IEEE |
| 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=The+Capacity+of+Private+Information+Retrieval+From+Coded+Databases&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Banawan%2C+Karim&rft.au=Ulukus%2C+Sennur&rft.date=2018-03-01&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=64&rft.issue=3&rft.spage=1945&rft.epage=1956&rft_id=info:doi/10.1109%2FTIT.2018.2791994&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TIT_2018_2791994 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |