{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:12Z","timestamp":1773377652854,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174274","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"1030-1034","source":"Crossref","is-referenced-by-count":7,"title":["The Minimum Upload Cost of Symmetric Private Information Retrieval"],"prefix":"10.1109","author":[{"given":"Yanliang","family":"Zhou","sequence":"first","affiliation":[{"name":"University of North Texas,Department of Electrical Engineering,Huawei,Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiwen","family":"Wang","sequence":"additional","affiliation":[{"name":"University of North Texas,Department of Electrical Engineering,Huawei,Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Sun","sequence":"additional","affiliation":[{"name":"University of North Texas,Department of Electrical Engineering,Huawei,Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengli","family":"Fu","sequence":"additional","affiliation":[{"name":"University of North Texas,Department of Electrical Engineering,Huawei,Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"The Capacity of Private Informa¬tion Retrieval with Eavesdroppers","author":"wang","year":"2018","journal-title":"IEEE Trans on Inf Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916079"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613332"},{"key":"ref13","article-title":"The capacity of multi-round pri¬vate information retrieval from byzantine databases","author":"yao","year":"2019"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref15","article-title":"The capacity of private information retrieval from uncoded storage constrained databases","author":"attia","year":"2018"},{"key":"ref16","article-title":"On the Storage Cost of Private Information Retrieval","author":"tian","year":"2019"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849542"},{"key":"ref18","article-title":"A new capacity-achieving private information retrieval scheme with (almost) optimal file length for coded servers","author":"zhu","year":"2019"},{"key":"ref4","article-title":"On the Capacity of Locally Decodable Codes","author":"sun","year":"2018"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2918207"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2848977"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276723"},{"key":"ref8","article-title":"Private information retrieval through wire¬tap channel ii: Privacy meets security","author":"banawan","year":"0"},{"key":"ref7","article-title":"On the Information Leakage in Private Information Retrieval Systems","author":"guo","year":"2019"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2725225"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174274.pdf?arnumber=9174274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:45Z","timestamp":1773347685000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174274\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174274","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}