{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T13:01:22Z","timestamp":1784638882521,"version":"3.55.0"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032325594","type":"print"},{"value":"9783032325600","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:00:00Z","timestamp":1784678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:00:00Z","timestamp":1784678400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-32560-0_19","type":"book-chapter","created":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T12:04:39Z","timestamp":1784635479000},"page":"528-558","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Updatable Private Set Intersection and\u00a0Beyond: Efficient Constructions via\u00a0Circuit PSI"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3563-9133","authenticated-orcid":false,"given":"Ferran","family":"Alborch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tom","family":"Chauvier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7152-6478","authenticated-orcid":false,"given":"Antonio","family":"Faonio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandre","family":"Fontaine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6139-6668","authenticated-orcid":false,"given":"Ferhat","family":"Karako\u00e7","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2099-2206","authenticated-orcid":false,"given":"Alptekin","family":"K\u00fcp\u00e7\u00fc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Camille","family":"Malek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0269-9495","authenticated-orcid":false,"given":"Melek","family":"\u00d6nen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,22]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Abadi, A., Dong, C., Murdoch, S.J., Terzis, S.: Multi-party updatable delegated private set intersection. In: Financial Cryptography and Data Security, pp. 100\u2013119 (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_6","DOI":"10.1007\/978-3-031-18283-9_6"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Agarwal, A., Cash, D., George, M., Kamara, S., Moataz, T., Singh, J.: Updatable private set intersection from structured encryption. IACR Commun. Cryptol. 2(4) (2026). https:\/\/doi.org\/10.62056\/av4fsgbmo","DOI":"10.62056\/av4fsgbmo"},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"van Baarsen, A., Stevens, M.: Amortizing circuit-PSI in the multiple sender\/receiver setting. IACR Commun. Cryptol. 1(3) (2024). https:\/\/doi.org\/10.62056\/a0fhsgvtw","DOI":"10.62056\/a0fhsgvtw"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Miao, P., Shi, X., Tromanhauser, M., Zeng, R.: Updatable private set intersection revisited: Extended functionalities, deletion, and worst-case complexity. In: Advances in Cryptology \u2013 ASIACRYPT 2024, pp. 200\u2013233 (2025). https:\/\/doi.org\/10.1007\/978-981-96-0938-3_7","DOI":"10.1007\/978-981-96-0938-3_7"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"378","DOI":"10.2478\/popets-2022-0051","volume":"2022","author":"S Badrinarayanan","year":"2022","unstructured":"Badrinarayanan, S., Miao, P., Xie, T.: Updatable private set intersection. Proc. Priv. Enhancing Technol. 2022(2), 378\u2013406 (2022). https:\/\/doi.org\/10.2478\/popets-2022-0051","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 1\u201310 (1988). https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"19_CR7","unstructured":"Benattar, G., Cornejo, M., Leontiadis, I., Poumeyrol, M., Shlomovits, O., Varlakov, D.: Paillier, 0.4.3 edn. (2022). https:\/\/crates.io\/crates\/kzen-paillier"},{"key":"19_CR8","unstructured":"Berke, A., Bakker, M., Vepakomma, P., Larson, K., Pentland, A.S.: Assessing disease exposure risk with location data: a proposal for cryptographic preservation of privacy (2020). https:\/\/arxiv.org\/abs\/2003.14412"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, pp. 291\u2013308 (2019). https:\/\/doi.org\/10.1145\/3319535.3354255","DOI":"10.1145\/3319535.3354255"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16"},{"key":"19_CR11","doi-asserted-by":"publisher","unstructured":"Chandran, G.R., Schneider, T., Stillger, M., Weinert, C.: Concretely efficient private set union via circuit-based psi. In: Proceedings of the 20th ACM Asia Conference on Computer and Communications Security, ASIA CCS 2025, pp. 149\u2013162 (2025). https:\/\/doi.org\/10.1145\/3708821.3710839","DOI":"10.1145\/3708821.3710839"},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"353","DOI":"10.2478\/popets-2022-0018","volume":"2022","author":"N Chandran","year":"2022","unstructured":"Chandran, N., Gupta, D., Shah, A.: Circuit-psi with linear complexity via relaxed batch OPPRF. Proc. Priv. Enhancing Technol. 2022(1), 353\u2013372 (2022). https:\/\/doi.org\/10.2478\/popets-2022-0018","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-030-64840-4_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"M Chase","year":"2020","unstructured":"Chase, M., Ghosh, E., Poburinnaya, O.: Secret-shared shuffle. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 342\u2013372. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_12"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-56877-1_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"M Chase","year":"2020","unstructured":"Chase, M., Miao, P.: Private set intersection in the internet setting from lightweight oblivious PRF. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 34\u201363. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_2"},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"Chen, H., Huang, Z., Laine, K., Rindal, P.: Labeled psi from fully homomorphic encryption with malicious security. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, pp. 1223\u20131237 (2018). https:\/\/doi.org\/10.1145\/3243734.3243836","DOI":"10.1145\/3243734.3243836"},{"key":"19_CR16","doi-asserted-by":"publisher","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 1243\u20131255 (2017). https:\/\/doi.org\/10.1145\/3133956.3134061","DOI":"10.1145\/3133956.3134061"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-319-98113-0_25","volume-title":"Security and Cryptography for Networks","author":"M Ciampi","year":"2018","unstructured":"Ciampi, M., Orlandi, C.: Combining private set-intersection with secure two-party computation. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 464\u2013482. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_25"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"MJ Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1\u201319. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_1"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-030-17659-4_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Ghosh","year":"2019","unstructured":"Ghosh, S., Nilges, T.: An algebraic approach to maliciously secure private set intersection. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 154\u2013185. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_6"},{"key":"19_CR20","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 218\u2013229 (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"19_CR21","unstructured":"Goldreich, O.: Foundations of Cryptography: Volume 2, Basic Applications, 1st edn. Cambridge University Press, USA (2009)"},{"key":"19_CR22","unstructured":"Google: Private intersection-sum protocols with applications to attributing aggregate ad conversions. https:\/\/research.google\/pubs\/pub51026\/"},{"key":"19_CR23","unstructured":"Hao, M., et al.: Unbalanced Circuit-PSI from oblivious Key-Value retrieval. In: 33rd USENIX Security Symposium (USENIX Security 2024), pp. 6435\u20136451 (2024). https:\/\/www.usenix.org\/conference\/usenixsecurity24\/presentation\/hao-meng-unbalanced"},{"key":"19_CR24","unstructured":"Harchandani, L.: Oblivious Transfer (OT), Oblivious Transfer Extensions (OTE) and multi-party protocols based on that, 0.11.0 edn. (2025). https:\/\/crates.io\/crates\/oblivious_transfer_protocols"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-662-46497-7_4","volume-title":"Theory of Cryptography","author":"C Hazay","year":"2015","unstructured":"Hazay, C.: Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 90\u2013120. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_4"},{"key":"19_CR26","doi-asserted-by":"publisher","unstructured":"Hetz, L., Schneider, T., Weinert, C.: Scaling mobile private contact discovery to billions of users. In: Computer Security \u2013 ESORICS 2023: 28th European Symposium on Research in Computer Security, 2023, Proceedings, Part I, pp. 455\u2013476 (2023). https:\/\/doi.org\/10.1007\/978-3-031-50594-2_23","DOI":"10.1007\/978-3-031-50594-2_23"},{"key":"19_CR27","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: 19th Annual Network and Distributed System Security Symposium, NDSS 2012. The Internet Society (2012). https:\/\/www.ndss-symposium.org\/ndss2012\/private-set-intersection-are-garbled-circuits-better-custom-protocols"},{"key":"19_CR28","unstructured":"Kales, D., Rechberger, C., Schneider, T., Senker, M., Weinert, C.: Mobile private contact discovery at scale. In: 28th USENIX Security Symposium (USENIX Security 2019), pp. 1447\u20131464 (2019). https:\/\/www.usenix.org\/conference\/usenixsecurity19\/presentation\/kales"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-662-45472-5_13","volume-title":"Financial Cryptography and Data Security","author":"S Kamara","year":"2014","unstructured":"Kamara, S., Mohassel, P., Raykova, M., Sadeghian, S.: Scaling private set intersection to billion-element sets. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014. LNCS, vol. 8437, pp. 195\u2013215. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45472-5_13"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-030-65411-5_20","volume-title":"Cryptology and Network Security","author":"F Karako\u00e7","year":"2020","unstructured":"Karako\u00e7, F., K\u00fcp\u00e7\u00fc, A.: Linear complexity private set intersection for secure two-party protocols. In: Krenn, S., Shulman, H., Vaudenay, S. (eds.) CANS 2020. LNCS, vol. 12579, pp. 409\u2013429. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65411-5_20"},{"key":"19_CR31","doi-asserted-by":"publisher","unstructured":"Karako\u00e7, F., K\u00fcp\u00e7\u00fc, A.: Enabling two-party secure computation on set intersection. IEEE Trans. Dependable Secure Comput. 1\u201312 (2025). https:\/\/doi.org\/10.1109\/TDSC.2025.3561472","DOI":"10.1109\/TDSC.2025.3561472"},{"issue":"4","key":"19_CR32","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1515\/popets-2017-0044","volume":"2017","author":"\u00c1 Kiss","year":"2017","unstructured":"Kiss, \u00c1., Liu, J., Schneider, T., Asokan, N., Pinkas, B.: Private set intersection for unequal set sizes with mobile applications. Proc. Priv. Enhancing Technol. 2017(4), 177\u2013197 (2017). https:\/\/doi.org\/10.1515\/popets-2017-0044","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"19_CR33","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS 2016, pp. 818\u2013829 (2016). https:\/\/doi.org\/10.1145\/2976749.2978381","DOI":"10.1145\/2976749.2978381"},{"key":"19_CR34","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Matania, N., Pinkas, B., Rosulek, M., Trieu, N.: Practical multi-party private set intersection from symmetric-key techniques. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 1257\u20131272 (2017). https:\/\/doi.org\/10.1145\/3133956.3134065","DOI":"10.1145\/3133956.3134065"},{"key":"19_CR35","unstructured":"Ling, G., Tang, P., Qiu, W.: Efficient updatable PSI from asymmetric PSI and PSU. Cryptology ePrint Archive, Paper 2024\/1712 (2024). https:\/\/eprint.iacr.org\/2024\/1712"},{"key":"19_CR36","unstructured":"Mahdavi, R.A., et al.: Pepsi: practically efficient private set intersection in the unbalanced setting. In: Proceedings of the 33rd USENIX Conference on Security Symposium, SEC 2024 (2024). https:\/\/www.usenix.org\/conference\/usenixsecurity24\/presentation\/mahdavi"},{"key":"19_CR37","unstructured":"Marlinspike, M.: Technology preview: private contact discovery for signal. https:\/\/signal.org\/blog\/private-contact-discovery\/"},{"key":"19_CR38","doi-asserted-by":"publisher","unstructured":"Meadows, C.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: 1986 IEEE Symposium on Security and Privacy, p. 134 (1986). https:\/\/doi.org\/10.1109\/SP.1986.10022","DOI":"10.1109\/SP.1986.10022"},{"key":"19_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"19_CR40","unstructured":"Nepper, P., Nair, K.C., Sukhanov, V., Khaneja, V.: Better password protections in chrome. https:\/\/security.googleblog.com\/2019\/12\/better-password-protections-in-chrome.html"},{"key":"19_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-030-26954-8_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"B Pinkas","year":"2019","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: SpOT-light: lightweight private set intersection from sparse OT extension. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 401\u2013431. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_13"},{"key":"19_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-030-45724-2_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"B Pinkas","year":"2020","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: PSI from PaXoS: fast, malicious private set intersection. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 739\u2013767. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_25"},{"key":"19_CR43","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: 23rd USENIX Security Symposium (USENIX Security 2014), pp. 797\u2013812 (2014). https:\/\/www.usenix.org\/system\/files\/conference\/usenixsecurity14\/sec14-paper-pinkas.pdf"},{"key":"19_CR44","doi-asserted-by":"publisher","unstructured":"Raghuraman, S., Rindal, P.: Blazing fast PSI from improved OKVS and subfield vole. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, pp. 2505\u20132517 (2022). https:\/\/doi.org\/10.1145\/3548606.3560658","DOI":"10.1145\/3548606.3560658"},{"key":"19_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/978-3-030-77886-6_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"P Rindal","year":"2021","unstructured":"Rindal, P., Schoppmann, P.: VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 901\u2013930. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_31"},{"key":"19_CR46","unstructured":"RustCrypto development team: RustCrypto: Advanced Encryption Standard (AES), 0.8.4 edn. (2024). https:\/\/crates.io\/crates\/aes"},{"issue":"11","key":"19_CR47","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"19_CR48","doi-asserted-by":"publisher","unstructured":"Son, Y., Jeong, J.: PSI with computation or circuit-psi for unbalanced sets from homomorphic encryption. In: Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, ASIA CCS 2023, pp. 342\u2013356 (2023). https:\/\/doi.org\/10.1145\/3579856.3582817","DOI":"10.1145\/3579856.3582817"},{"key":"19_CR49","doi-asserted-by":"publisher","unstructured":"Song, X., Yin, D., Bai, J., Dong, C., Chang, E.C.: Secret-shared shuffle with malicious security. In: Network and Distributed System Security Symposium 2024 (NDSS 2024) (2024). https:\/\/doi.org\/10.14722\/ndss.2024.24021","DOI":"10.14722\/ndss.2024.24021"},{"key":"19_CR50","unstructured":"Trieu, N., Shehata, K., Saxena, P., Shokri, R., Song, D.: Epione: lightweight contact tracing with strong privacy (2020). https:\/\/arxiv.org\/abs\/2004.13293"},{"key":"19_CR51","doi-asserted-by":"publisher","first-page":"8573","DOI":"10.1109\/TIFS.2024.3461475","volume":"19","author":"R Wang","year":"2024","unstructured":"Wang, R., Zhou, J., Cao, Z., Dong, X., Raymond Choo, K.K.: Updatable private set intersection with forward privacy. IEEE Trans. Inf. Forensics Secur. 19, 8573\u20138586 (2024). https:\/\/doi.org\/10.1109\/TIFS.2024.3461475","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"19_CR52","unstructured":"Wikipedia: Exposure notification. https:\/\/en.wikipedia.org\/wiki\/Exposure_Notification"},{"key":"19_CR53","doi-asserted-by":"publisher","unstructured":"Yang, Y., et al.: Maliciously secure circuit private set intersection via SPDZ-compatible oblivious PRF. Proc. Priv. Enhancing Technol. 2025(2), 680\u2013696 (2025). https:\/\/doi.org\/10.56553\/popets-2025-0082","DOI":"10.56553\/popets-2025-0082"},{"key":"19_CR54","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (SFCS 1986), pp. 162\u2013167 (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-32560-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T12:04:44Z","timestamp":1784635484000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-32560-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,22]]},"ISBN":["9783032325594","9783032325600"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-32560-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,22]]},"assertion":[{"value":"22 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stony Brook, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}