Private Information Retrieval in Graph-Based Replication Systems
In a Private Information Retrieval (PIR) protocol, a user can download a file from a database without revealing the identity of the file to each individual server. A PIR protocol is called t -private if the identity of the file remains concealed even if t of the servers collude. Graph based repl...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on information theory 2020-06, Vol.66 (6), p.3590-3602 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 3602 |
---|---|
container_issue | 6 |
container_start_page | 3590 |
container_title | IEEE transactions on information theory |
container_volume | 66 |
creator | Raviv, Netanel Tamo, Itzhak Yaakobi, Eitan |
description | In a Private Information Retrieval (PIR) protocol, a user can download a file from a database without revealing the identity of the file to each individual server. A PIR protocol is called t -private if the identity of the file remains concealed even if t of the servers collude. Graph based replication is a simple technique, which is prevalent in both theory and practice, for achieving robustness in storage systems. In this technique each file is replicated on two or more storage servers, giving rise to a (hyper-)graph structure. In this paper we study private information retrieval protocols in graph based replication systems. The main interest of this work is understanding the collusion structures which emerge in the underlying graph. Our main contribution is a 2-replication scheme which guarantees perfect privacy from acyclic sets in the graph, and guarantees partial-privacy in the presence of cycles. Furthermore, by providing an upper bound, it is shown that the PIR rate of this scheme is at most a factor of two from its optimal value for regular graphs. Lastly, we extend our results to larger replication factors and to graph-based coding, a generalization of graph based replication that induces smaller storage overhead and larger PIR rate in many cases. |
doi_str_mv | 10.1109/TIT.2019.2955053 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2406701755</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8910598</ieee_id><sourcerecordid>2406701755</sourcerecordid><originalsourceid>FETCH-LOGICAL-c333t-fc85b37edddc0b455c1c37b7a848a2450b1e2dfe0d54d247680e051a2840715a3</originalsourceid><addsrcrecordid>eNo9kE1Lw0AQhhdRsFbvgpeA59TZj-nu3tSitVBQtJ6XTTLBlDaJu2mh_96UFE_DyzzvDDyM3XKYcA72YbVYTQRwOxEWEVCesRFH1KmdojpnIwBuUquUuWRXMa77qJCLEXv8CNXed5Qs6rIJW99VTZ18Uhcq2vtNUtXJPPj2J332kYp-0W6qfIC-DrGjbbxmF6XfRLo5zTH7fn1Zzd7S5ft8MXtaprmUskvL3GAmNRVFkUOmEHOeS51pb5TxQiFknERREhSoCqH01AABci-MAs3RyzG7H-62ofndUezcutmFun_phIKpBq4RewoGKg9NjIFK14Zq68PBcXBHT6735I6e3MlTX7kbKhUR_ePGckBr5B_vj2MI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2406701755</pqid></control><display><type>article</type><title>Private Information Retrieval in Graph-Based Replication Systems</title><source>IEEE Electronic Library (IEL)</source><creator>Raviv, Netanel ; Tamo, Itzhak ; Yaakobi, Eitan</creator><creatorcontrib>Raviv, Netanel ; Tamo, Itzhak ; Yaakobi, Eitan</creatorcontrib><description><![CDATA[In a Private Information Retrieval (PIR) protocol, a user can download a file from a database without revealing the identity of the file to each individual server. A PIR protocol is called <inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula> -private if the identity of the file remains concealed even if <inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula> of the servers collude. Graph based replication is a simple technique, which is prevalent in both theory and practice, for achieving robustness in storage systems. In this technique each file is replicated on two or more storage servers, giving rise to a (hyper-)graph structure. In this paper we study private information retrieval protocols in graph based replication systems. The main interest of this work is understanding the collusion structures which emerge in the underlying graph. Our main contribution is a 2-replication scheme which guarantees perfect privacy from acyclic sets in the graph, and guarantees partial-privacy in the presence of cycles. Furthermore, by providing an upper bound, it is shown that the PIR rate of this scheme is at most a factor of two from its optimal value for regular graphs. Lastly, we extend our results to larger replication factors and to graph-based coding, a generalization of graph based replication that induces smaller storage overhead and larger PIR rate in many cases.]]></description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2019.2955053</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Computer science ; distributed storage systems ; Encoding ; Information retrieval ; Privacy ; Private information retrieval (PIR) ; Protocols ; Replication ; Resistance ; Servers ; Storage systems ; Upper bounds</subject><ispartof>IEEE transactions on information theory, 2020-06, Vol.66 (6), p.3590-3602</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c333t-fc85b37edddc0b455c1c37b7a848a2450b1e2dfe0d54d247680e051a2840715a3</citedby><cites>FETCH-LOGICAL-c333t-fc85b37edddc0b455c1c37b7a848a2450b1e2dfe0d54d247680e051a2840715a3</cites><orcidid>0000-0002-8000-0419 ; 0000-0002-9851-5234 ; 0000-0002-1686-1994</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8910598$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,777,781,793,27905,27906,54739</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8910598$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Raviv, Netanel</creatorcontrib><creatorcontrib>Tamo, Itzhak</creatorcontrib><creatorcontrib>Yaakobi, Eitan</creatorcontrib><title>Private Information Retrieval in Graph-Based Replication Systems</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description><![CDATA[In a Private Information Retrieval (PIR) protocol, a user can download a file from a database without revealing the identity of the file to each individual server. A PIR protocol is called <inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula> -private if the identity of the file remains concealed even if <inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula> of the servers collude. Graph based replication is a simple technique, which is prevalent in both theory and practice, for achieving robustness in storage systems. In this technique each file is replicated on two or more storage servers, giving rise to a (hyper-)graph structure. In this paper we study private information retrieval protocols in graph based replication systems. The main interest of this work is understanding the collusion structures which emerge in the underlying graph. Our main contribution is a 2-replication scheme which guarantees perfect privacy from acyclic sets in the graph, and guarantees partial-privacy in the presence of cycles. Furthermore, by providing an upper bound, it is shown that the PIR rate of this scheme is at most a factor of two from its optimal value for regular graphs. Lastly, we extend our results to larger replication factors and to graph-based coding, a generalization of graph based replication that induces smaller storage overhead and larger PIR rate in many cases.]]></description><subject>Computer science</subject><subject>distributed storage systems</subject><subject>Encoding</subject><subject>Information retrieval</subject><subject>Privacy</subject><subject>Private information retrieval (PIR)</subject><subject>Protocols</subject><subject>Replication</subject><subject>Resistance</subject><subject>Servers</subject><subject>Storage systems</subject><subject>Upper bounds</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE1Lw0AQhhdRsFbvgpeA59TZj-nu3tSitVBQtJ6XTTLBlDaJu2mh_96UFE_DyzzvDDyM3XKYcA72YbVYTQRwOxEWEVCesRFH1KmdojpnIwBuUquUuWRXMa77qJCLEXv8CNXed5Qs6rIJW99VTZ18Uhcq2vtNUtXJPPj2J332kYp-0W6qfIC-DrGjbbxmF6XfRLo5zTH7fn1Zzd7S5ft8MXtaprmUskvL3GAmNRVFkUOmEHOeS51pb5TxQiFknERREhSoCqH01AABci-MAs3RyzG7H-62ofndUezcutmFun_phIKpBq4RewoGKg9NjIFK14Zq68PBcXBHT6735I6e3MlTX7kbKhUR_ePGckBr5B_vj2MI</recordid><startdate>20200601</startdate><enddate>20200601</enddate><creator>Raviv, Netanel</creator><creator>Tamo, Itzhak</creator><creator>Yaakobi, Eitan</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-8000-0419</orcidid><orcidid>https://orcid.org/0000-0002-9851-5234</orcidid><orcidid>https://orcid.org/0000-0002-1686-1994</orcidid></search><sort><creationdate>20200601</creationdate><title>Private Information Retrieval in Graph-Based Replication Systems</title><author>Raviv, Netanel ; Tamo, Itzhak ; Yaakobi, Eitan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c333t-fc85b37edddc0b455c1c37b7a848a2450b1e2dfe0d54d247680e051a2840715a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Computer science</topic><topic>distributed storage systems</topic><topic>Encoding</topic><topic>Information retrieval</topic><topic>Privacy</topic><topic>Private information retrieval (PIR)</topic><topic>Protocols</topic><topic>Replication</topic><topic>Resistance</topic><topic>Servers</topic><topic>Storage systems</topic><topic>Upper bounds</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Raviv, Netanel</creatorcontrib><creatorcontrib>Tamo, Itzhak</creatorcontrib><creatorcontrib>Yaakobi, Eitan</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Raviv, Netanel</au><au>Tamo, Itzhak</au><au>Yaakobi, Eitan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Private Information Retrieval in Graph-Based Replication Systems</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2020-06-01</date><risdate>2020</risdate><volume>66</volume><issue>6</issue><spage>3590</spage><epage>3602</epage><pages>3590-3602</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract><![CDATA[In a Private Information Retrieval (PIR) protocol, a user can download a file from a database without revealing the identity of the file to each individual server. A PIR protocol is called <inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula> -private if the identity of the file remains concealed even if <inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula> of the servers collude. Graph based replication is a simple technique, which is prevalent in both theory and practice, for achieving robustness in storage systems. In this technique each file is replicated on two or more storage servers, giving rise to a (hyper-)graph structure. In this paper we study private information retrieval protocols in graph based replication systems. The main interest of this work is understanding the collusion structures which emerge in the underlying graph. Our main contribution is a 2-replication scheme which guarantees perfect privacy from acyclic sets in the graph, and guarantees partial-privacy in the presence of cycles. Furthermore, by providing an upper bound, it is shown that the PIR rate of this scheme is at most a factor of two from its optimal value for regular graphs. Lastly, we extend our results to larger replication factors and to graph-based coding, a generalization of graph based replication that induces smaller storage overhead and larger PIR rate in many cases.]]></abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TIT.2019.2955053</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0002-8000-0419</orcidid><orcidid>https://orcid.org/0000-0002-9851-5234</orcidid><orcidid>https://orcid.org/0000-0002-1686-1994</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 0018-9448 |
ispartof | IEEE transactions on information theory, 2020-06, Vol.66 (6), p.3590-3602 |
issn | 0018-9448 1557-9654 |
language | eng |
recordid | cdi_proquest_journals_2406701755 |
source | IEEE Electronic Library (IEL) |
subjects | Computer science distributed storage systems Encoding Information retrieval Privacy Private information retrieval (PIR) Protocols Replication Resistance Servers Storage systems Upper bounds |
title | Private Information Retrieval in Graph-Based Replication Systems |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T08%3A36%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Private%20Information%20Retrieval%20in%20Graph-Based%20Replication%20Systems&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Raviv,%20Netanel&rft.date=2020-06-01&rft.volume=66&rft.issue=6&rft.spage=3590&rft.epage=3602&rft.pages=3590-3602&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2019.2955053&rft_dat=%3Cproquest_RIE%3E2406701755%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2406701755&rft_id=info:pmid/&rft_ieee_id=8910598&rfr_iscdi=true |