{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:11:48Z","timestamp":1784301108713,"version":"3.55.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":["61871331"],"award-info":[{"award-number":["61871331"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Major Frontier Project of Sichuan Province","award":["2015JY0282"],"award-info":[{"award-number":["2015JY0282"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tifs.2019.2937634","type":"journal-article","created":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T19:22:01Z","timestamp":1566847321000},"page":"1248-1260","source":"Crossref","is-referenced-by-count":37,"title":["A New Capacity-Achieving Private Information Retrieval Scheme With (Almost) Optimal File Length for Coded Servers"],"prefix":"10.1109","volume":"15","author":[{"given":"Jinbao","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qifa","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chao","family":"Qi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaohu","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849542"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2883283"},{"key":"ref31","article-title":"Locally decodable codes and private information retrieval schemes","author":"yekhanin","year":"2007"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1721654.1721674"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref12","author":"cover","year":"2012","journal-title":"Elements of Information Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref14","first-page":"72","article-title":"A survey on private information retrieval","volume":"82","author":"gasarch","year":"2004","journal-title":"Bull EATCS"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_65"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_26"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2765629"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181949"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.03.002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2002.1180169"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055735"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282975"},{"key":"ref7","first-page":"173","article-title":"Practical byzantine fault tolerance","author":"castro","year":"1999","journal-title":"Proc of the 2nd USENIX Symp on Operating Systems Design and Implementation (OSDI)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63165-8_196"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27800-9_5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2599110"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2725225"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541531"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2815607"},{"key":"ref26","article-title":"On sub-packetization and access number of capacity-achieving PIR schemes for MDS coded non-colluding servers","author":"xu","year":"2017","journal-title":"arXiv 1712 02466"},{"key":"ref25","article-title":"Capacity-achieving private information retrieval codes with optimal message size and upload cost","author":"tian","year":"2018","journal-title":"arXiv 1808 07536"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/8833568\/08813077.pdf?arnumber=8813077","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:00:15Z","timestamp":1651078815000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8813077\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/tifs.2019.2937634","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}