{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:11Z","timestamp":1773377531949,"version":"3.50.1"},"reference-count":53,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF 17-13977,ECCS 18-07348"],"award-info":[{"award-number":["CCF 17-13977,ECCS 18-07348"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518017","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1112-1117","source":"Crossref","is-referenced-by-count":0,"title":["An Information-Theoretic Scheme for Multi-Party Private Set Intersection"],"prefix":"10.1109","author":[{"given":"Zhusheng","family":"Wang","sequence":"first","affiliation":[{"name":"University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karim","family":"Banawan","sequence":"additional","affiliation":[{"name":"Alexandria University,Faculty of Engineering,Electrical Engineering Department,Alexandria,Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sennur","family":"Ulukus","sequence":"additional","affiliation":[{"name":"University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2725225"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977058"},{"key":"ref33","author":"tian","year":"0","journal-title":"On the storage cost of private information retrieval"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989262"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2953883"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2918207"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849399"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2955053"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2964762"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.3390\/info10120372"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437511"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IWCIT.2018.8405043"},{"key":"ref29","author":"attia","year":"0","journal-title":"The capacity of private information retrieval from uncoded storage constrained databases"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"ref1","first-page":"1","article-title":"Efficient private matching and set intersection","author":"freedman","year":"2004","journal-title":"International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2906229"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977919"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2948845"},{"key":"ref24","first-page":"1","article-title":"Multimessage private information retrieval with private side information","author":"shariatpanahi","year":"2018","journal-title":"IEEE ITW"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2936023"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2888494"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CISS48834.2020.1570612786"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72738-5_15"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134065"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3057597"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_15"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2848977"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849351"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2884891"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2981282"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/16M1102562"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2828310"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2869154"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262857"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2883302"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844940"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref3","author":"wang","year":"0","journal-title":"Private set intersection A multimessage symmetric private information retrieval perspective"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777490"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006861"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006860"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54365-8_8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613532"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2954336"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2935440"},{"key":"ref48","author":"vithana","year":"0","journal-title":"Semantic private information retrieval"},{"key":"ref47","author":"tajeddine","year":"0","journal-title":"Private information retrieval over random linear networks"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916079"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2833050"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2933011"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977073"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518017.pdf?arnumber=9518017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:17Z","timestamp":1773347657000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518017\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":53,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518017","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}