{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T03:50:14Z","timestamp":1719892214922},"reference-count":42,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T00:00:00Z","timestamp":1710806400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100011958","name":"Danmarks Frie Forskningsfond","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011958","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004836","name":"Independent Research Fund Denmark","doi-asserted-by":"publisher","award":["DFF-7027-00053B"],"id":[{"id":"10.13039\/501100004836","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Finite Fields and Their Applications"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1016\/j.ffa.2024.102421","type":"journal-article","created":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T19:25:48Z","timestamp":1711653948000},"page":"102421","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Private information retrieval from locally repairable databases with colluding servers"],"prefix":"10.1016","volume":"96","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-2626-8139","authenticated-orcid":false,"given":"Umberto","family":"Mart\u00ednez-Pe\u00f1as","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ffa.2024.102421_br0010","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2018.2791994","article-title":"The capacity of private information retrieval from coded databases","volume":"64","author":"Banawan","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2024.102421_br0020","series-title":"Proc. IEEE Int. Symp. Info. Theory","first-page":"146","article-title":"PIR schemes with small download complexity and low storage requirements","author":"Blackburn","year":"2017"},{"issue":"7","key":"10.1016\/j.ffa.2024.102421_br0030","doi-asserted-by":"crossref","first-page":"4510","DOI":"10.1109\/TIT.2013.2252395","article-title":"Partial-MDS codes and their application to RAID type of architectures","volume":"59","author":"Blaum","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10.1016\/j.ffa.2024.102421_br0040","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1109\/LCOMM.2016.2627569","article-title":"A general construction for PMDS codes","volume":"21","author":"Calis","year":"2017","journal-title":"IEEE Commun. Lett."},{"key":"10.1016\/j.ffa.2024.102421_br0050","series-title":"Proc. IEEE Int. Symp. Info. Theory","first-page":"2038","article-title":"Locally repairable codes with multiple (ri,\u03b4i)-localities","author":"Chen","year":"2017"},{"key":"10.1016\/j.ffa.2024.102421_br0060","series-title":"Proce. 36th Annual Symposium on Foundations of Computer Science","first-page":"41","article-title":"Private information retrieval","author":"Chor","year":"1995"},{"issue":"6","key":"10.1016\/j.ffa.2024.102421_br0070","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/293347.293350","article-title":"Private information retrieval","volume":"45","author":"Chor","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/j.ffa.2024.102421_br0080","series-title":"Elements of Information Theory","author":"Cover","year":"2006"},{"issue":"4","key":"10.1016\/j.ffa.2024.102421_br0090","doi-asserted-by":"crossref","first-page":"2443","DOI":"10.1109\/TIT.2019.2954336","article-title":"One-shot PIR: refinement and lifting","volume":"66","author":"D'Oliveira","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2024.102421_br0100","series-title":"Proc. IEEE Int. Symp. Info. Theory","first-page":"2852","article-title":"Codes for distributed PIR with low storage overhead","author":"Fazeli","year":"2015"},{"issue":"1","key":"10.1016\/j.ffa.2024.102421_br0110","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/16M1102562","article-title":"Private information retrieval from coded databases with colluding servers","volume":"1","author":"Freij-Hollanti","year":"2017","journal-title":"SIAM J. Appl. Algebra Geom."},{"issue":"1","key":"10.1016\/j.ffa.2024.102421_br0120","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Probl. Inf. Transm."},{"issue":"9","key":"10.1016\/j.ffa.2024.102421_br0130","doi-asserted-by":"crossref","first-page":"5245","DOI":"10.1109\/TIT.2014.2332338","article-title":"Explicit maximally recoverable codes with locality","volume":"60","author":"Gopalan","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"10.1016\/j.ffa.2024.102421_br0140","doi-asserted-by":"crossref","first-page":"6925","DOI":"10.1109\/TIT.2012.2208937","article-title":"On the locality of codeword symbols","volume":"58","author":"Gopalan","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"183","key":"10.1016\/j.ffa.2024.102421_br0150","article-title":"On maximally recoverable local reconstruction codes","volume":"24","author":"Gopi","year":"2017","journal-title":"Electron. Colloq. Comput. Complex."},{"key":"10.1016\/j.ffa.2024.102421_br0160","series-title":"2012 USENIX Annual Technical Conference","first-page":"15","article-title":"Erasure coding in Windows Azure storage","author":"Huang","year":"2012"},{"key":"10.1016\/j.ffa.2024.102421_br0170","series-title":"Proc. IEEE Int. Symp. Info. Theory","first-page":"435","article-title":"Codes with unequal locality","author":"Kadhe","year":"2016"},{"issue":"8","key":"10.1016\/j.ffa.2024.102421_br0180","doi-asserted-by":"crossref","first-page":"4637","DOI":"10.1109\/TIT.2014.2329872","article-title":"Codes with local regeneration and erasure correction","volume":"60","author":"Kamath","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2024.102421_br0190","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1109\/TIFS.2020.3003572","article-title":"Private information retrieval schemes with product-matrix MBR codes","volume":"16","author":"Lavauzelle","year":"2020","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"2","key":"10.1016\/j.ffa.2024.102421_br0200","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TIT.2002.807285","article-title":"Linear network coding","volume":"49","author":"Li","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2024.102421_br0210","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.ffa.2016.04.004","article-title":"A characterization of MDS codes that have an error correcting pair","volume":"40","author":"M\u00e1rquez-Corbella","year":"2016","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.ffa.2024.102421_br0220","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/j.jalgebra.2018.02.005","article-title":"Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring","volume":"504","author":"Mart\u00ednez-Pe\u00f1as","year":"2018","journal-title":"J. Algebra"},{"issue":"8","key":"10.1016\/j.ffa.2024.102421_br0230","doi-asserted-by":"crossref","first-page":"4785","DOI":"10.1109\/TIT.2019.2912165","article-title":"Reliable and secure multishot network coding using linearized Reed-Solomon codes","volume":"65","author":"Mart\u00ednez-Pe\u00f1as","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"10.1016\/j.ffa.2024.102421_br0240","doi-asserted-by":"crossref","first-page":"7790","DOI":"10.1109\/TIT.2019.2924888","article-title":"Universal and dynamic locally repairable codes with maximal recoverability via sum-rank codes","volume":"65","author":"Mart\u00ednez-Pe\u00f1as","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20132","key":"10.1016\/j.ffa.2024.102421_br0250","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10623-016-0284-6","article-title":"Rank error-correcting pairs","volume":"84","author":"Mart\u00ednez-Pe\u00f1as","year":"2017","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.ffa.2024.102421_br0260","series-title":"2019 National Conference on Communications (NCC)","first-page":"1","article-title":"Maximally recoverable codes with hierarchical locality","author":"Nair","year":"2019"},{"issue":"3","key":"10.1016\/j.ffa.2024.102421_br0270","doi-asserted-by":"crossref","first-page":"480","DOI":"10.2307\/1968173","article-title":"Theory of non-commutative polynomials","volume":"34","author":"Ore","year":"1933","journal-title":"Ann. Math. (2)"},{"issue":"2","key":"10.1016\/j.ffa.2024.102421_br0280","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0108018","article-title":"Polynomial codes over certain finite fields","volume":"8","author":"Reed","year":"1960","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"10.1016\/j.ffa.2024.102421_br0290","series-title":"Proc. 39th Int. Conf. Very Large Data Bases","first-page":"325","article-title":"XORing elephants: novel erasure codes for big data","author":"Sathiamoorthy","year":"2013"},{"key":"10.1016\/j.ffa.2024.102421_br0300","series-title":"Proc. IEEE Int. Symp. Info. Theory","first-page":"856","article-title":"One extra bit of download ensures perfectly private information retrieval","author":"Shah","year":"2014"},{"key":"10.1016\/j.ffa.2024.102421_br0310","series-title":"Network Coding and Subspace Designs","first-page":"427","article-title":"Batch and PIR codes and their connections to locally repairable codes","author":"Skachek","year":"2018"},{"issue":"7","key":"10.1016\/j.ffa.2024.102421_br0320","doi-asserted-by":"crossref","first-page":"4075","DOI":"10.1109\/TIT.2017.2689028","article-title":"The capacity of private information retrieval","volume":"63","author":"Sun","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"10.1016\/j.ffa.2024.102421_br0330","doi-asserted-by":"crossref","first-page":"2361","DOI":"10.1109\/TIT.2017.2777490","article-title":"The capacity of robust private information retrieval with colluding databases","volume":"64","author":"Sun","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10.1016\/j.ffa.2024.102421_br0340","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/TIT.2017.2779454","article-title":"Private information retrieval from MDS coded data with colluding servers: settling a conjecture by Freij-Hollanti et al.","volume":"64","author":"Sun","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2024.102421_br0350","series-title":"Proc. IEEE Int. Symp. Info. Theory","first-page":"1908","article-title":"Private information retrieval schemes for coded data with arbitrary collusion patterns","author":"Tajeddine","year":"2017"},{"issue":"11","key":"10.1016\/j.ffa.2024.102421_br0360","doi-asserted-by":"crossref","first-page":"7081","DOI":"10.1109\/TIT.2018.2815607","article-title":"Private information retrieval from MDS coded data in distributed storage systems","volume":"64","author":"Tajeddine","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2024.102421_br0370","series-title":"Proc. IEEE Int. Symp. Info. Theory","first-page":"1411","article-title":"Private information retrieval from MDS coded data in distributed storage systems","author":"Tajeddine","year":"2016"},{"key":"10.1016\/j.ffa.2024.102421_br0380","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1109\/TIFS.2019.2928483","article-title":"Private information retrieval over random linear networks","volume":"15","author":"Tajeddine","year":"2020","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"8","key":"10.1016\/j.ffa.2024.102421_br0390","doi-asserted-by":"crossref","first-page":"4661","DOI":"10.1109\/TIT.2014.2321280","article-title":"A family of optimal locally recoverable codes","volume":"60","author":"Tamo","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.ffa.2024.102421_br0400","series-title":"Locally Decodable Codes and Private Information Retrieval Schemes. Information Theory and Security","author":"Yekhanin","year":"2010"},{"key":"10.1016\/j.ffa.2024.102421_br0410","series-title":"Proc. IEEE Int. Symp. Info. Theory","first-page":"640","article-title":"Bounds and constructions of codes with multiple localities","author":"Zeh","year":"2016"},{"key":"10.1016\/j.ffa.2024.102421_br0420","author":"Zhang"}],"container-title":["Finite Fields and Their Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1071579724000601?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1071579724000601?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T13:57:28Z","timestamp":1713880648000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1071579724000601"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":42,"alternative-id":["S1071579724000601"],"URL":"https:\/\/doi.org\/10.1016\/j.ffa.2024.102421","relation":{},"ISSN":["1071-5797"],"issn-type":[{"value":"1071-5797","type":"print"}],"subject":[],"published":{"date-parts":[[2024,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Private information retrieval from locally repairable databases with colluding servers","name":"articletitle","label":"Article Title"},{"value":"Finite Fields and Their Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ffa.2024.102421","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"102421"}}