{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:24:10Z","timestamp":1761294250274,"version":"3.37.3"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1617504","CCF-1907053","CNS-1731384"],"award-info":[{"award-number":["CCF-1617504","CCF-1907053","CNS-1731384"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-18-1-2057"],"award-info":[{"award-number":["N00014-18-1-2057"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-17-S-0002-03"],"award-info":[{"award-number":["W911NF-17-S-0002-03"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1109\/jsait.2021.3053481","type":"journal-article","created":{"date-parts":[[2021,1,22]],"date-time":"2021-01-22T23:03:19Z","timestamp":1611356599000},"page":"428-440","source":"Crossref","is-referenced-by-count":18,"title":["Double Blind <i>T<\/i>-Private Information Retrieval"],"prefix":"10.1109","volume":"2","author":[{"given":"Yuxiang","family":"Lu","sequence":"first","affiliation":[]},{"given":"Zhuqing","family":"Jia","sequence":"additional","affiliation":[]},{"given":"Syed A.","family":"Jafar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref73","DOI":"10.1109\/ALLERTON.2017.8262858"},{"year":"2016","author":"wang","journal-title":"Symmetric private information retrieval for MDS coded distributed storage","key":"ref72"},{"doi-asserted-by":"publisher","key":"ref71","DOI":"10.1201\/b16252"},{"doi-asserted-by":"publisher","key":"ref70","DOI":"10.1016\/0377-0427(89)90302-6"},{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1109\/TIT.2020.2977919"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1109\/TIT.2018.2883302"},{"year":"2019","author":"woolsey","journal-title":"Private information retrieval from heterogeneous uncoded storage constrained databases with reduced sub-messages","key":"ref33"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"372","DOI":"10.3390\/info10120372","article-title":"The capacity of private information retrieval from decentralized uncoded caching databases","volume":"10","author":"wei","year":"2019","journal-title":"Information"},{"year":"2018","author":"mohamed adel attia","journal-title":"The capacity of private information retrieval from uncoded storage constrained databases","key":"ref31"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1109\/TIT.2020.3011053"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1109\/TIT.2019.2936023"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1109\/ALLERTON.2017.8262857"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1109\/TIT.2020.2964762"},{"year":"2020","author":"guo","journal-title":"New results on the storage-retrieval tradeoff in private information retrieval systems","key":"ref34"},{"doi-asserted-by":"publisher","key":"ref60","DOI":"10.1109\/TIT.2020.2977082"},{"doi-asserted-by":"publisher","key":"ref62","DOI":"10.1109\/TIT.2020.3014973"},{"year":"2019","author":"jia","journal-title":"Cross-subspace alignment codes for coded distributed batch computation","key":"ref61"},{"doi-asserted-by":"publisher","key":"ref63","DOI":"10.1007\/978-3-540-24676-3_26"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1109\/TIFS.2018.2833050"},{"doi-asserted-by":"publisher","key":"ref64","DOI":"10.1109\/ACCESS.2019.2908024"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/TIT.2020.2977073"},{"doi-asserted-by":"publisher","key":"ref65","DOI":"10.1109\/ISIT44484.2020.9174230"},{"key":"ref66","first-page":"3","article-title":"Codes for distributed computing: A tutorial","volume":"67","author":"cadambe","year":"2017","journal-title":"IEEE Newsletter on ITS"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/TIT.2019.2916079"},{"year":"2018","author":"yu","journal-title":"Lagrange coded computing Optimal design for resiliency security and privacy","key":"ref67"},{"year":"2017","author":"yu","journal-title":"Polynomial codes an optimal design for high-dimensional coded matrix multiplication","key":"ref68"},{"key":"ref69","first-page":"32","article-title":"Double sequences and double series","volume":"14","author":"habil","year":"2016","journal-title":"IUG J Nat Stud"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1007\/3-540-49543-6_17"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1145\/359168.359176"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1137\/16M1102562"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/ITW.2017.8277997"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/ISIT.2017.8006861"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/TIT.2018.2890285"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/TIT.2017.2779454"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/TIT.2020.3013152"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/TIT.2019.2903206"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1109\/ITW44776.2019.8988956"},{"doi-asserted-by":"publisher","key":"ref51","DOI":"10.1109\/ITW.2018.8613304"},{"year":"2020","author":"obead","journal-title":"Private function computation for noncolluding coded databases","key":"ref59"},{"doi-asserted-by":"publisher","key":"ref58","DOI":"10.1109\/ISIT.2019.8849347"},{"doi-asserted-by":"publisher","key":"ref57","DOI":"10.1109\/TIT.2018.2888494"},{"year":"2017","author":"mirmohseni","journal-title":"Private function retrieval","key":"ref56"},{"year":"2020","author":"samy","journal-title":"Latent-variable private information retrieval","key":"ref55"},{"doi-asserted-by":"publisher","key":"ref54","DOI":"10.1109\/ISIT.2019.8849283"},{"doi-asserted-by":"publisher","key":"ref53","DOI":"10.1109\/ISIT.2019.8849842"},{"doi-asserted-by":"publisher","key":"ref52","DOI":"10.1109\/ISIT.2019.8849648"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/TIT.2017.2689028"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TIT.2017.2777490"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1109\/TIT.2018.2789426"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TIT.2018.2848977"},{"year":"2020","author":"samy","journal-title":"Asymmetric leaky private information retrieval","key":"ref13"},{"year":"2020","author":"lin","journal-title":"Multi-server weakly-private information retrieval","key":"ref14"},{"year":"2017","author":"wang","journal-title":"Secure private information retrieval from colluding databases with eavesdroppers","key":"ref15"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TIT.2018.2884891"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TIT.2018.2878034"},{"year":"2018","author":"wang","journal-title":"The $\\epsilon$ -error capacity of symmetric PIR with Byzantine adversaries","key":"ref18"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/TIT.2018.2869154"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/293347.293350"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/SFCS.1995.492461"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/SFCS.1986.25"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref8","first-page":"554","article-title":"A minimal model for secure computation","author":"feige","year":"1994","journal-title":"Proc 26th Annu ACM Symp Theory Comput"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/3335741.3335755"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.1109\/ISIT.2018.8437545"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/ISIT.2015.7282975"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1109\/TIT.2019.2918207"},{"year":"2019","author":"wang","journal-title":"Private set intersection A multimessage symmetric private information retrieval perspective","key":"ref45"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1109\/ALLERTON.2018.8635980"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1109\/ISIT44484.2020.9174094"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1109\/TIT.2018.2828310"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1109\/ISIT.2019.8849275"},{"year":"2019","author":"jia","journal-title":"On the capacity of secure distributed matrix multiplication","key":"ref44"},{"year":"2018","author":"shariatpanahi","journal-title":"Multimessage private information retrieval with private side information","key":"ref43"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/9380089\/9333655-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9380089\/09333655.pdf?arnumber=9333655","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T19:59:12Z","timestamp":1625515152000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9333655\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":73,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2021.3053481","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2021,3]]}}}