{"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":1784301108518,"version":"3.55.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262858","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T18:03:47Z","timestamp":1516298627000},"page":"1083-1090","source":"Crossref","is-referenced-by-count":55,"title":["Secure symmetric private information retrieval from colluding databases with adversaries"],"prefix":"10.1109","author":[{"given":"Qiwen","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikael","family":"Skoglund","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","author":"wang","year":"2016","journal-title":"Symmetric private information retrieval for MDS coded distributed storage"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"ref12","author":"fazeli","year":"2015","journal-title":"PIR with low storage overhead Coding instead of replication"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282975"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541531"},{"key":"ref15","author":"freij-hollanti","year":"2016","journal-title":"Private information retrieval from coded databases with colluding servers"},{"key":"ref16","author":"m\u00e9dard","year":"2011","journal-title":"Network Coding Fundamentals and Applications"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.78"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2314642"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162191"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276723"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7849060"},{"key":"ref5","author":"sun","year":"2016","journal-title":"The Capacity of Robust Private Information Retrieval with Colluding Databases"},{"key":"ref8","author":"banawan","year":"2017","journal-title":"Multi-message private information retrieval Capacity results and near-optimal schemes"},{"key":"ref7","author":"banawan","year":"2016","journal-title":"The capacity of private information retrieval from coded databases"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"ref9","author":"banawan","year":"2017","journal-title":"The capacity of private information retrieval from byzantine and colluding databases"},{"key":"ref20","author":"cover","year":"2012","journal-title":"Elements of Information Theory"}],"event":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2017,10,3]]},"end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253908\/8262705\/08262858.pdf?arnumber=8262858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,28]],"date-time":"2018-02-28T16:07:48Z","timestamp":1519834068000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262858\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262858","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}