{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:31:53Z","timestamp":1780633913568,"version":"3.54.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587399","type":"print"},{"value":"9783031587405","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-58740-5_12","type":"book-chapter","created":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T02:01:45Z","timestamp":1714269705000},"page":"340-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Fuzzy Private Set Intersection with\u00a0Large Hyperballs"],"prefix":"10.1007","author":[{"given":"Aron","family":"van Baarsen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2056-6079","authenticated-orcid":false,"given":"Sihang","family":"Pu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-030-90456-2_4","volume-title":"Theory of Cryptography","author":"N Alamati","year":"2021","unstructured":"Alamati, N., Branco, P., D\u00f6ttling, N., Garg, S., Hajiabadi, M., Pu, S.: Laconic private set intersection and applications. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13044, pp. 94\u2013125. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_4"},{"key":"12_CR2","unstructured":"van Baarsen, A., Pu, S.: Fuzzy private set intersection with large hyperballs. Cryptology ePrint Archive, Paper 2024\/330 (2024). https:\/\/eprint.iacr.org\/2024\/330"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-030-75248-4_13","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"S Badrinarayanan","year":"2021","unstructured":"Badrinarayanan, S., Miao, P., Raghuraman, S., Rindal, P.: Multi-party threshold private set intersection with sublinear communication. In: Garay, J.A. (ed.) PKC 2021, Part II. LNCS, vol. 12711, pp. 349\u2013379. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_13"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Bartusek, J., Garg, S., Jain, A., Policharla, G.V.: End-to-end secure messaging with traceability only for illegal content. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02023. LNCS, Part\u00a0V, Germany, Lyon, France, 23\u201327 April 2023, vol. 14008, pp. 35\u201366. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_2","DOI":"10.1007\/978-3-031-30589-4_2"},{"key":"12_CR5","unstructured":"Bhowmick, A., Boneh, D., Myers, S., Talwar, K., Tarbe, K.: The Apple PSI system (2021). https:\/\/www.apple.com\/child-safety\/pdf\/Apple_PSI_System_Security_Protocol_and_Analysis.pdf"},{"key":"12_CR6","unstructured":"Bienstock, A., Patel, S., Seo, J.Y., Yeo, K.: Near-optimal oblivious key-value stores for efficient PSI, PSU and volume-hiding multi-maps. In: USENIX Security Symposium, pp. 301\u2013318. USENIX Association (2023)"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Branco, P., D\u00f6ttling, N., Pu, S.: Multiparty cardinality testing for threshold private intersection. In: Garay, J. (ed.) 24th International Conference on Theory and Practice of Public Key Cryptography, PKC\u00a02021. LNCS, Part\u00a0II, Virtual Event, 10\u201313 May 2021, vol. 12711, pp. 32\u201360. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_2","DOI":"10.1007\/978-3-030-75248-4_2"},{"key":"12_CR8","unstructured":"Chakraborti, A., Fanti, G., Reiter, M.K.: Distance-aware private set intersection. In: USENIX Security Symposium. USENIX Association (2023)"},{"key":"12_CR9","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, Part III. LNCS, vol. 12172, pp. 34\u201363. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_2"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Chen, H., Huang, Z., Laine, K., Rindal, P.: Labeled PSI from fully homomorphic encryption with malicious security. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) 25th Conference on Computer and Communications Security, ACM CCS 2018, Toronto, ON, Canada, 15\u201319 October 2018, pp. 1223\u20131237. ACM Press (2018). https:\/\/doi.org\/10.1145\/3243734.3243836","DOI":"10.1145\/3243734.3243836"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) 24th Conference on Computer and Communications Security, ACM CCS 2017, Dallas, TX, USA, 31 October\u2013November 2 2017, pp. 1243\u20131255. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3134061","DOI":"10.1145\/3133956.3134061"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Chmielewski, L., Hoepman, J.: Fuzzy private matching (extended abstract). In: ARES, pp. 327\u2013334. IEEE Computer Society (2008)","DOI":"10.1109\/ARES.2008.170"},{"key":"12_CR13","unstructured":"Chor, B., Gilboa, N., Naor, M.: Private information retrieval by keywords. Cryptology ePrint Archive, Report 1998\/003 (1998). https:\/\/eprint.iacr.org\/1998\/003"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Cong, K., et al.: Labeled PSI from homomorphic encryption with reduced computation and communication. In: Vigna, G., Shi, E. (eds.) 28th Conference on Computer and Communications Security, ACM CCS 2021, Virtual Event, Republic of Korea, 15\u201319 November 2021, pp. 1135\u20131150. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484760","DOI":"10.1145\/3460120.3484760"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Dong, C., Chen, L., Wen, Z.: When private set intersection meets big data: an efficient and scalable protocol. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) 20th Conference on Computer and Communications Security, ACM CCS 2013, Berlin, Germany, 4\u20138 November 2013, pp. 789\u2013800. ACM Press (2013). https:\/\/doi.org\/10.1145\/2508859.2516701","DOI":"10.1145\/2508859.2516701"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1007\/978-3-030-64840-4_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"T Duong","year":"2020","unstructured":"Duong, T., Phan, D.H., Trieu, N.: Catalic: delegated PSI cardinality with applications to contact tracing. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part III. LNCS, vol. 12493, pp. 870\u2013899. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_29"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-319-78372-7_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"P-A Dupont","year":"2018","unstructured":"Dupont, P.-A., Hesse, J., Pointcheval, D., Reyzin, L., Yakoubov, S.: Fuzzy password-authenticated key exchange. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 393\u2013424. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_13"},{"key":"12_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":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-84245-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"G Garimella","year":"2021","unstructured":"Garimella, G., Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: Oblivious key-value stores and amplification for private set intersection. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part II. LNCS, vol. 12826, pp. 395\u2013425. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_14"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Garimella, G., Rosulek, M., Singh, J.: Structure-aware private set intersection, with applications to fuzzy matching. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology, CRYPTO\u00a02022, Part\u00a0I. LNCS, Santa Barbara, CA, USA, 15\u201318 August 2022, vol. 13507, pp. 323\u2013352. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_12","DOI":"10.1007\/978-3-031-15802-5_12"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Garimella, G., Rosulek, M., Singh, J.: Malicious secure, structure-aware private set intersection. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology, CRYPTO\u00a02023, Part\u00a0I. LNCS, Santa Barbara, CA, USA, 20\u201324 August 2023, vol. 14081, pp. 577\u2013610. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_19","DOI":"10.1007\/978-3-031-38557-5_19"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-26951-7_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"S Ghosh","year":"2019","unstructured":"Ghosh, S., Simkin, M.: The communication complexity of threshold private set intersection. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part II. LNCS, vol. 11693, pp. 3\u201329. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_1"},{"key":"12_CR23","doi-asserted-by":"publisher","unstructured":"Ghosh, S., Simkin, M.: Threshold private set intersection with better communication complexity. In: Boldyreva, A., Kolesnikov, V. (eds.) 26th International Conference on Theory and Practice of Public Key Cryptography, PKC\u00a02023, Part\u00a0II. LNCS, Atlanta, GA, USA, 7\u201310 May 2023, vol. 13941, pp. 251\u2013272. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_9","DOI":"10.1007\/978-3-031-31371-4_9"},{"key":"12_CR24","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: ISOC Network and Distributed System Security Symposium, NDSS\u00a02012, San Diego, CA, USA, 5\u20138 February 2012. The Internet Society (2012)"},{"key":"12_CR25","unstructured":"ECRYPT II: eBACS: ECRYPT Benchmarking of Cryptographic Systems (2023). https:\/\/bench.cr.yp.to\/results-sha3"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Indyk, P., Woodruff, D.P.: Polylogarithmic private approximations and efficient matching. In: Halevi, S., Rabin, T. (eds.) 3rd Theory of Cryptography Conference, TCC\u00a02006. LNCS, New York, NY, USA, 4\u20137 March 2006, vol.\u00a03876, pp. 245\u2013264. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_13","DOI":"10.1007\/11681878_13"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Ion, M., et al.: On deploying secure computing: private intersection-sum-with-cardinality. In: EuroS &P, pp. 370\u2013389. IEEE (2020)","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) 23rd Conference on Computer and Communications Security, ACM CCS 2016, Vienna, Austria, 24\u201328 October 2016, pp. 818\u2013829. ACM Press (2016). https:\/\/doi.org\/10.1145\/2976749.2978381","DOI":"10.1145\/2976749.2978381"},{"key":"12_CR29","unstructured":"Lindell, Y.: How to simulate it - a tutorial on the simulation proof technique. Cryptology ePrint Archive, Report 2016\/046 (2016). https:\/\/eprint.iacr.org\/2016\/046"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Meadows, C.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: S &P, pp. 134\u2013137. IEEE Computer Society (1986)","DOI":"10.1109\/SP.1986.10022"},{"key":"12_CR31","unstructured":"Muffett, A.: Facebook: password hashing & authentication (2015). https:\/\/rwc.iacr.org\/2015\/program.html"},{"key":"12_CR32","doi-asserted-by":"publisher","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. In: 38th Annual Symposium on Foundations of Computer Science, Miami Beach, Florida, 19\u201322 October 1997, pp. 458\u2013467. IEEE Computer Society Press (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646134","DOI":"10.1109\/SFCS.1997.646134"},{"key":"12_CR33","unstructured":"Pal, B., et al.: Might I Get Pwned: a second generation compromised credential checking service. In: USENIX Security Symposium, pp. 1831\u20131848. USENIX Association (2022)"},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-17659-4_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Pinkas","year":"2019","unstructured":"Pinkas, B., Schneider, T., Tkachenko, O., Yanai, A.: Efficient circuit-based PSI with linear communication. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 122\u2013153. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_5"},{"key":"12_CR35","doi-asserted-by":"publisher","unstructured":"Raghuraman, S., Rindal, P.: Blazing fast PSI from improved OKVS and subfield VOLE. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) 29th Conference on Computer and Communications Security, ACM CCS 2022, Los Angeles, CA, USA, 7\u201311 November 2022, pp. 2505\u20132517. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560658","DOI":"10.1145\/3548606.3560658"},{"key":"12_CR36","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, Part II. LNCS, vol. 12697, pp. 901\u2013930. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_31"},{"key":"12_CR37","unstructured":"Uzun, E., Chung, S.P., Kolesnikov, V., Boldyreva, A., Lee, W.: Fuzzy labeled private set intersection with applications to private real-time biometric search. In: Bailey, M., Greenstadt, R. (eds.) 30th USENIX Security Symposium, USENIX Security 2021, 11\u201313 August 2021, pp. 911\u2013928. USENIX Association (2021)"},{"key":"12_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-642-14423-3_15","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"Q Ye","year":"2010","unstructured":"Ye, Q., Steinfeld, R., Pieprzyk, J., Wang, H.: Efficient fuzzy matching and intersection on private datasets. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol. 5984, pp. 211\u2013228. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14423-3_15"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58740-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T00:05:23Z","timestamp":1777334723000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58740-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587399","9783031587405"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58740-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}