{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:11:46Z","timestamp":1784301106901,"version":"3.55.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1617504"],"award-info":[{"award-number":["CCF-1617504"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-1731384"],"award-info":[{"award-number":["CNS-1731384"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ONR","award":["N00014-16-1-2629"],"award-info":[{"award-number":["N00014-16-1-2629"]}]},{"name":"ONR","award":["N00014-18-1-2057"],"award-info":[{"award-number":["N00014-18-1-2057"]}]},{"DOI":"10.13039\/100000183","name":"ARL","doi-asserted-by":"publisher","award":["W911NF-16-1-0215"],"award-info":[{"award-number":["W911NF-16-1-0215"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/tit.2018.2789426","type":"journal-article","created":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T23:10:17Z","timestamp":1515107417000},"page":"5743-5754","source":"Crossref","is-referenced-by-count":63,"title":["Multiround Private Information Retrieval: Capacity and Storage Overhead"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8777-7987","authenticated-orcid":false,"given":"Hua","family":"Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Syed Ali","family":"Jafar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1677"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2095490"},{"key":"ref31","first-page":"149","article-title":"Representation of matroids in combinatorial mathematics and its applications","volume":"44","author":"ingleton","year":"1971","journal-title":"Combinat Math Appl"},{"key":"ref30","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref10","author":"banawan","year":"2016","journal-title":"The capacity of private information retrieval from coded databases"},{"key":"ref11","author":"wang","year":"2016","journal-title":"Symmetric private information retrieval for MDS coded distributed storage"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282975"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851744"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928963"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048502"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.39"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120342"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2011.5743582"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541605"},{"key":"ref28","author":"zhang","year":"2016","journal-title":"On private information retrieval array codes"},{"key":"ref4","first-page":"72","article-title":"A survey on private information retrieval","volume":"82","author":"gasarch","year":"2004","journal-title":"Bull EATCS"},{"key":"ref27","author":"blackburn","year":"2016","journal-title":"PIR schemes with small download complexity and low storage requirements"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_26"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1721654.1721674"},{"key":"ref8","author":"sun","year":"2016","journal-title":"The Capacity of Robust Private Information Retrieval with Colluding Databases"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2725225"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7849060"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"ref20","first-page":"912","article-title":"Information-theoretic private information retrieval: A unified construction","author":"beimel","year":"2001","journal-title":"Automata Languages and Programming"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.03.002"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541531"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"ref26","author":"blackburn","year":"2016","journal-title":"Pir array codes with optimal PIR rate"},{"key":"ref25","author":"rao","year":"2016","journal-title":"Lower bound on the redundancy of PIR codes"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8410392\/8246575-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8410392\/08246575.pdf?arnumber=8246575","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:54:12Z","timestamp":1649444052000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8246575\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":33,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2789426","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8]]}}}