{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T20:45:56Z","timestamp":1782506756695,"version":"3.54.5"},"reference-count":66,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3701023","type":"journal-article","created":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T19:52:56Z","timestamp":1780948376000},"page":"86926-86943","source":"Crossref","is-referenced-by-count":0,"title":["PCPSI: Efficient Unbalanced Private Set Intersection Using Homomorphic Encryption With Plaintext\u2013Ciphertext Multiplication"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-9411-1513","authenticated-orcid":false,"given":"Dongju","family":"Lee","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Seoul National University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4537-1677","authenticated-orcid":false,"given":"Sungyeon","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Seoul National University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-7310-2161","authenticated-orcid":false,"given":"Youyeon","family":"Joo","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Seoul National University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4621-2434","authenticated-orcid":false,"given":"Kevin","family":"Nam","sequence":"additional","affiliation":[{"name":"School of Computing, Kyung Hee University, Yongin-si, Gyeonggi-do, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6412-2926","authenticated-orcid":false,"given":"Yunheung","family":"Paek","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Seoul National University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1447","article-title":"Mobile private contact discovery at scale","volume-title":"Proc. 28th USENIX Secur. Symp. (USENIX Secur.)","volume":"2019","author":"Kales"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CNS.2017.8228673"},{"key":"ref3","article-title":"Epione: Lightweight contact tracing with strong privacy","author":"Trieu","year":"2020","journal-title":"arXiv:2004.13293"},{"key":"ref4","volume-title":"Password Monitor: Safeguarding Passwords in Microsoft Edge","author":"Kannepalli","year":"2021"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0044"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-58387-6_11"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243836"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354229"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90456-2_4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484760"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560642"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3579856.3582817"},{"key":"ref14","first-page":"6453","article-title":"PEPSI: Practically efficient private set intersection in the unbalanced setting","volume-title":"Proc. 33rd USENIX Secur. Symp. (USENIX Secur.)","author":"Mahdavi"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2025.240365"},{"key":"ref16","first-page":"493","article-title":"BatchCrypt: Efficient homomorphic encryption for cross-silo federated learning","volume-title":"Proc. USENIX Annu. Tech. Conf. (USENIX ATC)","author":"Zhang"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"ref20","first-page":"144","article-title":"Somewhat practical fully homomorphic encryption","author":"Fan","year":"2012","journal-title":"Cryptol. ePrint Arch."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2024.3392424"},{"key":"ref22","article-title":"FedML-HE: An efficient homomorphic-encryption-based privacy-preserving federated learning system","volume-title":"Proc. Workshop Federated Learn. Age Found. Models (FL@FM)","author":"Jin"},{"key":"ref23","first-page":"70476","article-title":"Dual defense: Enhancing privacy and mitigating poisoning attacks in federated learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Gao"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3698038.3698557"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.80"},{"key":"ref27","volume-title":"Have I Been Pwned","author":"Hunt","year":"2013"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2018-0037"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560651"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462216"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-87101-7_4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"ref33","first-page":"515","article-title":"Phasing: Private set intersection using permutation-based hashing","volume-title":"Proc. 24th USENIX Secur. Symp. (USENIX Secur.)","volume":"2015","author":"Pinkas"},{"key":"ref34","first-page":"447","article-title":"Faster private set intersection based on OT extension","volume-title":"Proc. USENIX Secur.","volume":"2014","author":"Pinkas"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"ref42","article-title":"Private set intersection: Are garbled circuits better than custom protocols?","volume-title":"Proc. NDSS","author":"Huang"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45472-5_13"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516701"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19379-8_10"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49890-3_12"},{"key":"ref47","volume-title":"Microsoft SEAL","year":"2023"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1038\/s41587-019-0046-x"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2903651"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/AsiaJCIS50894.2020.00025"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3295941"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3676641.3716251"},{"key":"ref53","first-page":"1651","article-title":"GAZELLE: A low latency framework for secure neural network inference","volume-title":"Proc. 27th USENIX Secur. Symp. (USENIX Secur.)","author":"Juvekar"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3411501.3419418"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3582016.3582065"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3622781.3674175"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/0202007"},{"issue":"2","key":"ref58","first-page":"3","article-title":"Some extremal postage stamp bases","volume":"13","author":"Challis","year":"2010","journal-title":"J. Integer Sequences"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"ref60","first-page":"1723","article-title":"Constant-weight PIR: Single-round keyword PIR via constant-weight equality operators","volume-title":"Proc. 31st USENIX Secur. Symp. (USENIX Secur.)","author":"Mahdavi"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2009.61"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/11586821_2"},{"key":"ref65","first-page":"187","article-title":"How to exchange secrets with oblivious transfer","volume":"2005","author":"Rabin","year":"1981","journal-title":"Cryptol. ePrint Arch."},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11554284.pdf?arnumber=11554284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T19:46:51Z","timestamp":1782503211000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11554284\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":66,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3701023","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}