{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:11:51Z","timestamp":1784301111972,"version":"3.55.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61941106"],"award-info":[{"award-number":["61941106"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61871331"],"award-info":[{"award-number":["61871331"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science (JSPS) Grant-in-Aid for Scientific Research","doi-asserted-by":"publisher","award":["18H01133"],"award-info":[{"award-number":["18H01133"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1109\/tit.2021.3087425","type":"journal-article","created":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T17:17:32Z","timestamp":1623172652000},"page":"5370-5386","source":"Crossref","is-referenced-by-count":7,"title":["Capacity-Achieving Private Information Retrieval Schemes From Uncoded Storage Constrained Servers With Low Sub-Packetization"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8088-0076","authenticated-orcid":false,"given":"Jinbao","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0746-9819","authenticated-orcid":false,"given":"Qifa","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7938-7812","authenticated-orcid":false,"given":"Xiaohu","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9086-8668","authenticated-orcid":false,"given":"Ying","family":"Miao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref38","article-title":"Capacity-achieving private information retrieval schemes from uncoded storage constrained servers with low sub-packetization","author":"zhu","year":"2021","journal-title":"arXiv 2102 08058"},{"key":"ref33","article-title":"Extended Markov games to learn multiple tasks in multi-agent reinforcement learning","author":"le\u00f3n","year":"2020","journal-title":"arXiv 2002 06000"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053372"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849767"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3015818"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2937634"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2920635"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1721654.1721674"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"ref11","first-page":"72","article-title":"A survey on private information retrieval","volume":"82","author":"gasarch","year":"2004","journal-title":"Bull EATCS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_65"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2900313"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2317316"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_26"},{"key":"ref19","article-title":"Lower bound on the redundancy of PIR codes","author":"rao","year":"2016","journal-title":"arXiv 1605 01869"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2918207"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055735"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800059"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref6","first-page":"402","article-title":"Computationally private information retrieval with polylogarithmic communication","author":"cachin","year":"1999","journal-title":"Proc Int Conf Theory Appl Cryptograph Techn Adv Cryptol"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437874"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2942311"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27800-9_5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282975"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989262"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3023016"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref21","first-page":"1237","article-title":"Coded caching with linear subpacketization is possible using Ruzsa–Szeméredi graphs","author":"shanmugam","year":"2017","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2789426"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2725225"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2018.8422198"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2815607"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9487479\/09448051.pdf?arnumber=9448051","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:17Z","timestamp":1652194457000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9448051\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":38,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3087425","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8]]}}}