{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T14:48:25Z","timestamp":1783954105190,"version":"3.55.0"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172161"],"award-info":[{"award-number":["62172161"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62132005"],"award-info":[{"award-number":["62132005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172162"],"award-info":[{"award-number":["62172162"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Cloud Technology Endowed Professorship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tifs.2024.3461475","type":"journal-article","created":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T17:41:18Z","timestamp":1726508478000},"page":"8573-8586","source":"Crossref","is-referenced-by-count":9,"title":["Updatable Private Set Intersection With Forward Privacy"],"prefix":"10.1109","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-6414-2661","authenticated-orcid":false,"given":"Ruochen","family":"Wang","sequence":"first","affiliation":[{"name":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3294-9774","authenticated-orcid":false,"given":"Jun","family":"Zhou","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5250-5030","authenticated-orcid":false,"given":"Zhenfu","family":"Cao","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5844-0223","authenticated-orcid":false,"given":"Xiaolei","family":"Dong","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9208-5336","authenticated-orcid":false,"given":"Kim-Kwang","family":"Raymond Choo","sequence":"additional","affiliation":[{"name":"Department of Information Systems and Cyber Security, The University of Texas at San Antonio, San Antonio, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315309"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"ref3","first-page":"1447","article-title":"Mobile private contact discovery at scale","volume-title":"Proc. 28th USENIX Security Symp.","author":"Kales"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526127"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978381"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560658"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559378"},{"key":"ref9","first-page":"301","article-title":"Near-optimal oblivious key-value stores for efficient PSI, PSU and volume-hiding multi-maps","volume-title":"Proc. 32nd USENIX Secur. Symp. (USENIX Security)","author":"Bienstock"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2020.2968320"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/BigDataSecurity-HPSC-IDS49724.2020.00053"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0044"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-18283-9_6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2022-0051"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1986.10022"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337012"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"ref18","article-title":"Private set intersection: Are garbled circuits better than custom protocols?","volume-title":"Proc. NDSS","author":"Huang"},{"key":"ref19","first-page":"515","article-title":"Phasing: Private set intersection using permutation-based hashing","volume-title":"Proc. 24th USENIX Conf. Secur. Symp.","author":"Pinkas"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76969-9_12"},{"key":"ref28","first-page":"3835","article-title":"Authenticated private information retrieval","volume-title":"Proc. 32nd USENIX Secur. Symp.","author":"Colombo"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978407"},{"key":"ref30","article-title":"PIR-Tor: Scalable anonymous communication using private information retrieval","volume-title":"Proc. 20th USENIX Secur. Symp. (USENIX Security)","author":"Mittal"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90456-2_2"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/sfcs.1995.492461"},{"key":"ref33","first-page":"1811","article-title":"Communication\u2013computation trade-offs in PIR","volume-title":"Proc. 30th USENIX Secur. Symp.","author":"Ali"},{"key":"ref34","first-page":"1723","article-title":"Constant-weight PIR: Single-round keyword PIR via constant-weight equality operators","volume-title":"Proc. USENIX Secur. Symp. (USENIX Security)","author":"Mahdavi"},{"key":"ref35","first-page":"3853","article-title":"Don\u2019t be dense: Efficient keyword PIR for sparse databases","volume-title":"Proc. 32nd USENIX Secur. Symp. (USENIX Security)","author":"Patel"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978303"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/jiot.2023.3274390"},{"key":"ref40","first-page":"707","article-title":"All your queries are belong to us: The power of file-injection attacks on searchable encryption","volume-title":"Proc. USENIX Secur. Symp.","author":"Zhang"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133970"},{"key":"ref42","article-title":"Efficient Gauss elimination for near-quadratic matrices with one short random block per row, with applications","author":"Dietzfelbinger","year":"2019","journal-title":"arXiv:1907.04750"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00062"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3485381"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833700"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10319981\/10680634.pdf?arnumber=10680634","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T05:54:27Z","timestamp":1727330067000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10680634\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/tifs.2024.3461475","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}