{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T03:11:18Z","timestamp":1769915478525,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":36,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819544332","type":"print"},{"value":"9789819544349","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T00:00:00Z","timestamp":1762992000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T00:00:00Z","timestamp":1762992000000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-4434-9_8","type":"book-chapter","created":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T23:03:11Z","timestamp":1762988591000},"page":"173-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Fuzzy Labeled PSI from\u00a0Vector Ring-OLE"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7049-733X","authenticated-orcid":false,"given":"Dung","family":"Bui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2636-4406","authenticated-orcid":false,"given":"Kelong","family":"Cong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,13]]},"reference":[{"key":"8_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":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-63688-7_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Applebaum","year":"2017","unstructured":"Applebaum, B., Damg\u00e5rd, I., Ishai, Y., Nielsen, M., Zichron, L.: Secure arithmetic computation with constant computational overhead. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 223\u2013254. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_8"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Aranha, D.F., Lin, C., Orlandi, C., Simkin, M.: Laconic private set-intersection from pairings. In: Yin et\u00a0al. [36], pp. 111\u2013124. https:\/\/doi.org\/10.1145\/3548606.3560642","DOI":"10.1145\/3548606.3560642"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-19379-8_10","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"G Ateniese","year":"2011","unstructured":"Ateniese, G., De Cristofaro, E., Tsudik, G.: (If) size matters: size-hiding private set intersection. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 156\u2013173. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_10"},{"key":"8_CR5","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":"8_CR6","doi-asserted-by":"publisher","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 291\u2013308. ACM Press (2019).https:\/\/doi.org\/10.1145\/3319535.3354255","DOI":"10.1145\/3319535.3354255"},{"key":"8_CR7","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":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-56880-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"E Boyle","year":"2020","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient\u00a0pseudorandom\u00a0correlation\u00a0generators from ring-LPN. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 387\u2013416. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_14"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-46803-6_12","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"E Boyle","year":"2015","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 337\u2013367. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_12"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Bui, D., Cong, K.: Efficient fuzzy labeled PSI from vector ring-OLE. Cryptology ePrint Archive, Paper 2025\/1470 (2025). https:\/\/eprint.iacr.org\/2025\/1470","DOI":"10.1007\/978-981-95-4434-9_8"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Bui, D., Couteau, G.: Improved private set intersection for sets with small entries. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023, Part\u00a0II. LNCS, vol. 13941, pp. 190\u2013220. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_7","DOI":"10.1007\/978-3-031-31371-4_7"},{"key":"8_CR12","unstructured":"Chakraborti, A., Fanti, G., Reiter, M.K.: Distance-aware private set intersection. In: 32nd USENIX Security Symposium (USENIX Security 2023), pp. 319\u2013336. USENIX Association, Anaheim, CA (2023)"},{"key":"8_CR13","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.) ACM CCS 2018, pp. 1223\u20131237. ACM Press (2018). https:\/\/doi.org\/10.1145\/3243734.3243836","DOI":"10.1145\/3243734.3243836"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Chongchitmate, W., Ishai, Y., Lu, S., Ostrovsky, R.: PSI from ring-OLE. In: Yin et\u00a0al. [36], pp. 531\u2013545. https:\/\/doi.org\/10.1145\/3548606.3559378","DOI":"10.1145\/3548606.3559378"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Cong, K., Das, D., Park, J., Pereira, H.V.L.: SortingHat: efficient private decision tree evaluation via homomorphic encryption and transciphering. In: Yin et\u00a0al. [36], pp. 563\u2013577. https:\/\/doi.org\/10.1145\/3548606.3560702","DOI":"10.1145\/3548606.3560702"},{"key":"8_CR16","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.) ACM CCS 2021, pp. 1135\u20131150. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484760","DOI":"10.1145\/3460120.3484760"},{"key":"8_CR17","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":"8_CR18","unstructured":"Galois, Inc.: swanky: A suite of rust libraries for secure computation (2019). https:\/\/github.com\/GaloisInc\/swanky"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Gao, Y., Qi, L., Liu, X., Luo, Y., Wang, L.: Efficient fuzzy private set intersection from fuzzy mapping. In: Advances in Cryptology \u2013 ASIACRYPT 2024: 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, 9\u201313 December 2024, Proceedings, Part VI, pp. 36\u201368. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-981-96-0938-3_2","DOI":"10.1007\/978-981-96-0938-3_2"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Garimella, G., Goff, B., Miao, P.: Computation efficient structure aware PSI from incremental function secret sharing. Cryptology ePrint Archive, Paper 2024\/842 (2024). https:\/\/eprint.iacr.org\/2024\/842","DOI":"10.1007\/978-3-031-68397-8_10"},{"key":"8_CR21","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.) CRYPTO\u00a02022, Part\u00a0I. LNCS, 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":"8_CR22","doi-asserted-by":"publisher","unstructured":"Garimella, G., Rosulek, M., Singh, J.: Malicious secure, structure-aware private set intersection. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0I. LNCS, 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":"8_CR23","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":"8_CR24","doi-asserted-by":"publisher","unstructured":"Hallgren, P.A., Orlandi, C., Sabelfeld, A.: PrivatePool: privacy-preserving ridesharing. In: K\u00f6pf, B., Chong, S. (eds.) CSF 2017 Computer Security Foundations Symposium, pp. 276\u2013291. IEEE Computer Society Press (2017). https:\/\/doi.org\/10.1109\/CSF.2017.24","DOI":"10.1109\/CSF.2017.24"},{"key":"8_CR25","doi-asserted-by":"publisher","unstructured":"Huberman, B.A., Franklin, M., Hogg, T.: Enhancing privacy and trust in electronic communities. In: Proceedings of the 1st ACM Conference on Electronic Commerce, EC 1999, pp. 78\u201386. Association for Computing Machinery, New York (1999). https:\/\/doi.org\/10.1145\/336992.337012","DOI":"10.1145\/336992.337012"},{"key":"8_CR26","unstructured":"Ion, M., et al.: On deploying secure computing commercially: private intersection-sum protocols and their business applications. Cryptology ePrint Archive, Report 2019\/723 (2019). https:\/\/eprint.iacr.org\/2019\/723"},{"key":"8_CR27","unstructured":"Kales, D., Rechberger, C., Schneider, T., Senker, M., Weinert, C.: Mobile private contact discovery at scale. In: Heninger, N., Traynor, P. (eds.) USENIX Security 2019, pp. 1447\u20131464. USENIX Association (2019)"},{"key":"8_CR28","unstructured":"Liu, H., Wang, X., Yang, K., Yu, Y.: The hardness of LPN over any integer ring and field for PCG applications. Cryptology ePrint Archive, Report 2022\/712 (2022). https:\/\/eprint.iacr.org\/2022\/712"},{"key":"8_CR29","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":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-10366-7_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"B Pinkas","year":"2009","unstructured":"Pinkas, B., Schneider, T., Smart, N.P., Williams, S.C.: Secure two-party computation is practical. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 250\u2013267. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_15"},{"key":"8_CR31","doi-asserted-by":"publisher","unstructured":"Raghuraman, S., Rindal, P.: Blazing fast PSI from improved OKVS and subfield VOLE. In: Yin et\u00a0al. [36], pp. 2505\u20132517. https:\/\/doi.org\/10.1145\/3548606.3560658","DOI":"10.1145\/3548606.3560658"},{"key":"8_CR32","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":"8_CR33","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.) USENIX Security 2021, pp. 911\u2013928. USENIX Association (2021)"},{"key":"8_CR34","doi-asserted-by":"publisher","unstructured":"Weng, C., Yang, K., Katz, J., Wang, X.: Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits. In: 2021 IEEE Symposium on Security and Privacy, pp. 1074\u20131091. IEEE Computer Society Press (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00056","DOI":"10.1109\/SP40001.2021.00056"},{"key":"8_CR35","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pp. 162\u2013167. IEEE Computer Society Press (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"8_CR36","unstructured":"Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.): ACM CCS 2022. ACM Press (2022)"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4434-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T10:02:10Z","timestamp":1769853730000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4434-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,13]]},"ISBN":["9789819544332","9789819544349"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4434-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,13]]},"assertion":[{"value":"13 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Osaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2025","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":"cans2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cy2sec.comm.eng.osaka-u.ac.jp\/miyaji-lab\/event\/cans2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}