{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:21:19Z","timestamp":1761294079974,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003977","name":"ISF","doi-asserted-by":"publisher","award":["1817\/18"],"award-info":[{"award-number":["1817\/18"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001742","name":"BSF-NSF","doi-asserted-by":"publisher","award":["2016692"],"award-info":[{"award-number":["2016692"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Technion Fellowship"},{"name":"Technion Hiroshi Fujiwara Cyber Security Research Center and the Israel Cyber Directorate"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1109\/tit.2020.2977631","type":"journal-article","created":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T21:06:12Z","timestamp":1583183172000},"page":"4917-4934","source":"Crossref","is-referenced-by-count":15,"title":["Bounds on the Length of Functional PIR and Batch Codes"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5158-4187","authenticated-orcid":false,"given":"Yiwei","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4315-4400","authenticated-orcid":false,"given":"Tuvi","family":"Etzion","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9851-5234","authenticated-orcid":false,"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664867"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282532"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)90344-8"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524007"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524510"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541488"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007009"},{"key":"ref35","article-title":"The capacity of private computation","author":"sun","year":"2017","journal-title":"arXiv 1710 11098"},{"key":"ref34","first-page":"1","article-title":"Coding scheme for optimizing random I\/O performance","author":"sharon","year":"2013","journal-title":"Proc Non-Volatile Memories Workshop"},{"journal-title":"Covering Codes","year":"1997","author":"cohen","key":"ref10"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620388"},{"key":"ref11","article-title":"Private information retrieval for coded storage","author":"chan","year":"2014","journal-title":"arXiv 1410 5489"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282975"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057221"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057043"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(200003)16:2<209::AID-RSA6>3.0.CO;2-1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095232"},{"key":"ref17","first-page":"91","article-title":"Scalable and private media consumption with Popcorn","author":"gupta","year":"2016","journal-title":"Proc USENIX\/ACM Symp Netw Syst Design Implement"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"ref19","article-title":"PIR with low storage overhead: Coding instead of replication","author":"fazeli","year":"2015","journal-title":"arXiv 1505 06241"},{"key":"ref28","article-title":"Lower bound on the redundancy of PIR codes","author":"rao","year":"2016","journal-title":"arXiv 1605 01869"},{"key":"ref4","first-page":"50","article-title":"Lower asymptotic bound on the number of linear code words in a sphere of given radius in $F_{q}^{n}$","volume":"23","author":"blinovskii","year":"1987","journal-title":"Problems Inf Transmiss"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849736"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2942311"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2728791"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2925723"},{"key":"ref5","first-page":"99","article-title":"Asymptotically exact uniform bounds for spectra of cosets of linear codes","volume":"26","author":"blinovskii","year":"1990","journal-title":"Problems Inf Transmiss"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282453"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12280-9_15"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2852294"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(87)90055-0"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277956"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646125"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"journal-title":"Linear Codes With Disjoint Repair Groups","year":"2016","author":"wootters","key":"ref42"},{"key":"ref24","article-title":"Lengthening and extending binary private information retrieval codes","author":"lin","year":"2017","journal-title":"arXiv 1707 03495"},{"key":"ref41","first-page":"299","article-title":"Splinter: Practical private queries on public data","author":"wang","year":"2017","journal-title":"Proc USENIX\/ACM Symp Netw Syst Design Implement"},{"journal-title":"Error Control Coding","year":"2004","author":"lin","key":"ref23"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2538219"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849736"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2200291"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/IWCIT.2018.8405043"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9141502\/9020118-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9141502\/09020118.pdf?arnumber=9020118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:24:11Z","timestamp":1651080251000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9020118\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":45,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.2977631","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2020,8]]}}}