{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:31:51Z","timestamp":1766579511109,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T00:00:00Z","timestamp":1558051200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T00:00:00Z","timestamp":1558051200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Grant Nos.11431003","61571310"],"award-info":[{"award-number":["Grant Nos.11431003","61571310"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Post-Doctoral Science Foundation of China","award":["Grant No. 2017M610942"],"award-info":[{"award-number":["Grant No. 2017M610942"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10623-019-00640-x","type":"journal-article","created":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T15:42:42Z","timestamp":1558107762000},"page":"2611-2623","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A general private information retrieval scheme for MDS coded databases with colluding servers"],"prefix":"10.1007","volume":"87","author":[{"given":"Yiwei","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Gennian","family":"Ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,17]]},"reference":[{"issue":"2","key":"640_CR1","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1109\/TIT.2018.2852294","volume":"65","author":"H Asi","year":"2019","unstructured":"Asi H., Yaakobi E.: Nearly optimal constructions of PIR and batch codes. IEEE Trans. Inform. Theory 65(2), 947\u2013964 (2019).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"640_CR2","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-12280-9_15","volume-title":"Cryptology and Network Security","author":"Daniel Augot","year":"2014","unstructured":"Augot D., Levy-dit-Vehel F., Shikfa A.: A storage-efficient and robust Private Information Retrieval Scheme allowing few servers. In: Proceedings of Cryptology and Network Security (CANS), pp. 222\u2013239 (2014)."},{"issue":"3","key":"640_CR3","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1109\/TIT.2018.2791994","volume":"64","author":"K Banawan","year":"2018","unstructured":"Banawan K., Ulukus S.: The capacity of private information retrieval from coded databases. IEEE Trans. Inform. Theory 64(3), 1945\u20131956 (2018).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"640_CR4","unstructured":"Beimel A., Ishai Y., Kushilevitz E., Raymond J.-F.: Breaking the $$O(n^{1\/(2k-1)})$$ barrier for information-theoretic private information retrieval. In: Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS), pp. 261\u2013270 (2002)."},{"key":"640_CR5","doi-asserted-by":"crossref","unstructured":"Blackburn S., Etzion T.: PIR array codes with optimal virtual server rate. arXiv preprint \n                    arXiv:1607.00235v6\n                    \n                   (2016).","DOI":"10.1109\/ISIT.2017.8007011"},{"key":"640_CR6","doi-asserted-by":"crossref","unstructured":"Blackburn S., Etzion T., Paterson M.: PIR schemes with small download complexity and low storage requirements. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 146\u2013150. \n                    arXiv:1609.07027\n                    \n                   (2017).","DOI":"10.1109\/ISIT.2017.8006507"},{"key":"640_CR7","doi-asserted-by":"crossref","unstructured":"Chan T., Ho S., Yamamoto H.: Private information retrieval for coded storage. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 2842\u20132846 (2015).","DOI":"10.1109\/ISIT.2015.7282975"},{"key":"640_CR8","unstructured":"Chor B., Goldreich O., Kushilevitz E., Sudan M.: Private information retrieval. In: Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS), pp. 41\u201350 (1995)."},{"issue":"6","key":"640_CR9","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor B., Kushilevitz E., Goldreich O., Sudan M.: Private information retrieval. J. ACM 45(6), 965\u2013981 (1998).","journal-title":"J. ACM"},{"issue":"4","key":"640_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2968443","volume":"63","author":"Zeev Dvir","year":"2016","unstructured":"Dvir Z., Gopi S.: 2-server PIR with sub-polynomial communication. J. ACM 63(4), article 39 (2016).","journal-title":"Journal of the ACM"},{"issue":"6","key":"640_CR11","doi-asserted-by":"publisher","first-page":"1694","DOI":"10.1137\/090772721","volume":"41","author":"K Efremenko","year":"2012","unstructured":"Efremenko K.: 3-Query locally decodable codes of subexponential length. SIAM J. Comput. 41(6), 1694\u20131703 (2012).","journal-title":"SIAM J. Comput."},{"key":"640_CR12","doi-asserted-by":"crossref","unstructured":"Fazeli A., Vardy A., Yaakobi E.: Codes for distributed PIR with low storage overhead. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 2852\u20132856 (2015).","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"640_CR13","unstructured":"Fazeli A., Vardy A., Yaakobi E.: PIR with low storage overhead: coding instead of replication. arXiv preprint \n                    arXiv:1505.06241\n                    \n                   (2015)."},{"issue":"1","key":"640_CR14","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/16M1102562","volume":"1","author":"R Freij-Hollanti","year":"2017","unstructured":"Freij-Hollanti R., Gnilke O., Hollanti C., Karpuk D.: Private information retrieval from coded databases with colluding servers. SIAM J. Appl. Algebra Geom. 1(1), 647\u2013664 (2017).","journal-title":"SIAM J. Appl. Algebra Geom."},{"key":"640_CR15","unstructured":"Rao S., Vardy A.: Lower bound on the redundancy of PIR codes. arXiv preprint \n                    arXiv:1605.01869\n                    \n                   (2016)."},{"key":"640_CR16","doi-asserted-by":"crossref","unstructured":"Shah N.B., Rashmi K.V., Ramchandran K.: One extra bit of download ensures perfectly private information retrieval. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 856\u2013860 (2014).","DOI":"10.1109\/ISIT.2014.6874954"},{"issue":"7","key":"640_CR17","doi-asserted-by":"publisher","first-page":"4075","DOI":"10.1109\/TIT.2017.2689028","volume":"63","author":"H Sun","year":"2017","unstructured":"Sun H., Jafar S.: The capacity of private information retrieval. IEEE Trans. Inform. Theory 63(7), 4075\u20134088 (2017).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"640_CR18","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1109\/TIT.2017.2779454","volume":"64","author":"H Sun","year":"2018","unstructured":"Sun H., Jafar S.: Private information retrieval from MDS coded data with colluding servers: settling a conjecture by Freij-Hollanti, et al. IEEE Trans. Inform. Theory 64(2), 1000\u20131022 (2018).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"640_CR19","doi-asserted-by":"publisher","first-page":"2361","DOI":"10.1109\/TIT.2017.2777490","volume":"64","author":"H Sun","year":"2018","unstructured":"Sun H., Jafar S.: The capacity of robust private information retrieval with colluding databases. IEEE Trans. Inform. Theory 64(4), 2361\u20132370 (2018).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"640_CR20","doi-asserted-by":"crossref","unstructured":"Tajeddine R., Rouayheb S.E.: Private information retrieval from MDS coded data in distributed storage systems. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 1411\u20131415 (2016).","DOI":"10.1109\/ISIT.2016.7541531"},{"issue":"11","key":"640_CR21","doi-asserted-by":"publisher","first-page":"7081","DOI":"10.1109\/TIT.2018.2815607","volume":"64","author":"R Tajeddine","year":"2018","unstructured":"Tajeddine R., Gnilke O., Rouayheb S.E.: Private information retrieval from MDS coded data in distributed storage systems. IEEE Trans. Inform. Theory 64(11), 7081\u20137093 (2018).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"640_CR22","unstructured":"Vajha M., Ramkumar V., Kumar P.V.: Binary, shortened projective Reed Muller codes for coded private information retrieval. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 2648\u20132652. \n                    arXiv:1702.05074\n                    \n                   (2017)."},{"issue":"1","key":"640_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1326554.1326555","volume":"55","author":"Sergey Yekhanin","year":"2008","unstructured":"Yekhanin S.: Towards 3-query locally decodable codes of subexponential length. J. ACM 55(1), article 1 (2008).","journal-title":"Journal of the ACM"},{"issue":"4","key":"640_CR24","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/1721654.1721674","volume":"53","author":"S Yekhanin","year":"2010","unstructured":"Yekhanin S.: Private information retrieval. Commun. ACM 53(4), 68\u201373 (2010).","journal-title":"Commun. ACM"},{"key":"640_CR25","unstructured":"Zhang Y., Wang X., Wei H., Ge G.: On private information retrieval array codes. arXiv preprint \n                    arXiv:1609.09167\n                    \n                   (2016)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00640-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00640-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00640-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T23:24:50Z","timestamp":1589585090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00640-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,17]]},"references-count":25,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["640"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00640-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2019,5,17]]},"assertion":[{"value":"20 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}