{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:14:11Z","timestamp":1778087651552,"version":"3.51.4"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253163","type":"print"},{"value":"9783032253170","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-3-032-25317-0_14","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:41:07Z","timestamp":1778085667000},"page":"408-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Malicious Private Set Union with\u00a0Two-Sided Output"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-2056-6079","authenticated-orcid":false,"given":"Sihang","family":"Pu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3821-2263","authenticated-orcid":false,"given":"Jiahui","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6013-9512","authenticated-orcid":false,"given":"Ni","family":"Trieu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,7]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Abdalla, M., Haase, B., Hesse, J.: Security analysis of CPace. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT\u00a02021, Part\u00a0IV. LNCS, vol. 13093, pp. 711\u2013741. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92068-5_24","DOI":"10.1007\/978-3-030-92068-5_24"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-13051-4_2","volume-title":"Selected Areas in Cryptography \u2013 SAC 2014","author":"DF Aranha","year":"2014","unstructured":"Aranha, D.F., Fouque, P.-A., Qian, C., Tibouchi, M., Zapalowicz, J.-C.: Binary elligator squared. In: Joux, A., Youssef, A. (eds.) SAC 2014. LNCS, vol. 8781, pp. 20\u201337. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13051-4_2"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Hamburg, M., Krasnova, A., Lange, T.: Elligator: elliptic-curve points indistinguishable from uniform random strings. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 967\u2013980. ACM Press (2013). https:\/\/doi.org\/10.1145\/2508859.2516734","DOI":"10.1145\/2508859.2516734"},{"key":"14_CR4","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: Calandrino, J.A., Troncoso, C. (eds.) USENIX Security 2023, pp. 301\u2013318. USENIX Association (2023)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56\u201373. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_4"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/11593447_13","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"J Brickell","year":"2005","unstructured":"Brickell, J., Shmatikov, V.: Privacy-preserving graph algorithms in the semi-honest model. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 236\u2013252. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11593447_13"},{"key":"14_CR7","unstructured":"Buddhavarapu, P., Knox, A., Mohassel, P., Sengupta, S., Taubeneck, E., Vlaskin, V.: Private matching for compute. Cryptology ePrint Archive, Paper 2020\/599 (2020). https:\/\/eprint.iacr.org\/2020\/599, https:\/\/eprint.iacr.org\/2020\/599"},{"key":"14_CR8","unstructured":"Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.: SEPIA: Privacy-preserving aggregation of multi-domain network events and statistics. In: 19th USENIX Security Symposium (USENIX Security 10). USENIX Association, Washington, DC (2010). https:\/\/www.usenix.org\/conference\/usenixsecurity10\/sepia-privacy-preserving-aggregation-multi-domain-network-events-and"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-030-32101-7_21","volume-title":"Financial Cryptography and Data Security","author":"J Camenisch","year":"2019","unstructured":"Camenisch, J., De Caro, A., Ghosh, E., Sorniotti, A.: Oblivious PRF on committed vector inputs and application to deduplication of encrypted data. In: Goldberg, I., Moore, T. (eds.) FC 2019. LNCS, vol. 11598, pp. 337\u2013356. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_21"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J Camenisch","year":"2003","unstructured":"Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 126\u2013144. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_8"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19\u201340. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_2"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th ACM STOC, pp. 494\u2013503. ACM Press (2002). https:\/\/doi.org\/10.1145\/509907.509980","DOI":"10.1145\/509907.509980"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Casacuberta, S., Hesse, J., Lehmann, A.: SoK: Oblivious pseudorandom functions. In: 2022 IEEE European Symposium on Security and Privacy, pp. 625\u2013646. IEEE Comput. Soc. Press (2022). https:\/\/doi.org\/10.1109\/EuroSP53844.2022.00045","DOI":"10.1109\/EuroSP53844.2022.00045"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Chandran, G.R., Schneider, T., Stillger, M., Weinert, C.: Concretely efficient private set union via circuit-based PSI. ACM AsiaCCS 2025 (2025). https:\/\/eprint.iacr.org\/2024\/1494","DOI":"10.1145\/3708821.3710839"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) CRYPTO\u201982, pp. 199\u2013203. Plenum Press, New York, USA (1982). https:\/\/doi.org\/10.1007\/978-1-4757-0602-4_18","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO\u201992. LNCS, vol.\u00a0740, pp. 89\u2013105. Springer, Berlin, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_7","DOI":"10.1007\/3-540-48071-4_7"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Chen, Y.H., Lindell, Y.: Optimizing and implementing Fischlin\u2019s transform for UC-secure zero-knowledge. Cryptology ePrint Archive, Paper 2024\/526 (2024). https:\/\/eprint.iacr.org\/2024\/526","DOI":"10.62056\/a66chey6b"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Chen, Y., Zhang, M., Zhang, C., Dong, M., Liu, W.: Private set operations from multi-query reverse private membership test. In: Tang, Q., Teague, V. (eds.) PKC\u00a02024, Part\u00a0II. LNCS, vol. 14603, pp. 387\u2013416. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57725-3_13","DOI":"10.1007\/978-3-031-57725-3_13"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-30580-4_28","volume-title":"Public Key Cryptography - PKC 2005","author":"Y Dodis","year":"2005","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 416\u2013431. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30580-4_28"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11535218_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"M Fischlin","year":"2005","unstructured":"Fischlin, M.: Communication-efficient non-interactive proofs of knowledge with online extractors. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 152\u2013168. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_10"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"E Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 16\u201330. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052225"},{"key":"14_CR24","unstructured":"Galois, Inc.: swanky: A suite of rust libraries for secure computation (2019). https:\/\/github.com\/GaloisInc\/swanky"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Garimella, G., Mohassel, P., Rosulek, M., Sadeghian, S., Singh, J.: Private set operations from oblivious switching. In: Garay, J. (ed.) PKC\u00a02021, Part\u00a0II. LNCS, vol. 12711, pp. 591\u2013617. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_21","DOI":"10.1007\/978-3-030-75248-4_21"},{"key":"14_CR26","unstructured":"Gordon, D., Hazay, C., Le, P.H., Liang, M.: More efficient (reusable) private set union. Cryptology ePrint Archive, Paper 2022\/713 (2022). https:\/\/eprint.iacr.org\/2022\/713"},{"issue":"4","key":"14_CR27","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/s00145-010-9067-9","volume":"23","author":"J Groth","year":"2010","unstructured":"Groth, J.: A verifiable secret shuffle of homomorphic encryptions. J. Cryptol. 23(4), 546\u2013579 (2010). https:\/\/doi.org\/10.1007\/s00145-010-9067-9","journal-title":"J. Cryptol."},{"key":"14_CR28","unstructured":"Guo, X., Han, Y., Liu, Z., Wang, D., Jia, Y., Li, J.: Birds of a feather flock together: how set bias helps to deanonymize you via revealed intersection sizes. In: Butler, K.R.B., Thomas, K. (eds.) USENIX Security 2022, pp. 1487\u20131504. USENIX Association (2022)"},{"key":"14_CR29","unstructured":"Hazay, C., Lindell, Y.: A note on the relation between the definitions of security for semi-honest and malicious adversaries. Cryptology ePrint Archive, Report 2010\/551 (2010). https:\/\/eprint.iacr.org\/2010\/551"},{"issue":"3","key":"14_CR30","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s00145-011-9098-x","volume":"25","author":"C Hazay","year":"2011","unstructured":"Hazay, C., Nissim, K.: Efficient set operations in the presence of malicious adversaries. J. Cryptol. 25(3), 383\u2013433 (2011). https:\/\/doi.org\/10.1007\/s00145-011-9098-x","journal-title":"J. Cryptol."},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-540-24638-1_4","volume-title":"Theory of Cryptography","author":"D Hofheinz","year":"2004","unstructured":"Hofheinz, D., M\u00fcller-Quade, J.: Universally composable commitments using random oracles. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 58\u201376. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_4"},{"key":"14_CR32","doi-asserted-by":"publisher","unstructured":"Hogan, K., et al.: Secure multiparty computation for cooperative cyber risk assessment. In: 2016 IEEE Cybersecurity Development (SecDev), pp. 75\u201376 (2016). https:\/\/doi.org\/10.1109\/SecDev.2016.028","DOI":"10.1109\/SecDev.2016.028"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-662-45608-8_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"S Jarecki","year":"2014","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H.: Round-optimal password-protected secret sharing and T-PAKE in the password-only model. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 233\u2013253. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_13"},{"key":"14_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-00457-5_34","volume-title":"Theory of Cryptography","author":"S Jarecki","year":"2009","unstructured":"Jarecki, S., Liu, X.: Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 577\u2013594. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_34"},{"key":"14_CR35","unstructured":"Jia, Y., Sun, S.F., Zhou, H.S., Gu, D.: Scalable private set union, with stronger security. In: Balzarotti, D., Xu, W. (eds.) USENIX Security 2024. USENIX Association (2024)"},{"key":"14_CR36","unstructured":"Jia, Y., Sun, S., Zhou, H.S., Du, J., Gu, D.: Shuffle-based private set union: faster and more secure. In: Butler, K.R.B., Thomas, K. (eds.) USENIX Security 2022, pp. 2947\u20132964. USENIX Association (2022)"},{"issue":"9","key":"14_CR37","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TKDE.2004.45","volume":"16","author":"M Kantarcioglu","year":"2004","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowl. Data Eng. 16(9), 1026\u20131037 (2004). https:\/\/doi.org\/10.1109\/TKDE.2004.45","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"14_CR38","doi-asserted-by":"publisher","unstructured":"Keller, M., Orsini, E., Scholl, P.: Actively secure OT extension with optimal overhead. In: Gennaro, R., Robshaw, M.J.B. (eds.) CRYPTO\u00a02015, Part\u00a0I. LNCS, vol.\u00a09215, pp. 724\u2013741. Springer, Berlin, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_35","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"14_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/978-3-030-34621-8_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"V Kolesnikov","year":"2019","unstructured":"Kolesnikov, V., Rosulek, M., Trieu, N., Wang, X.: Scalable private set union from symmetric-key techniques. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11922, pp. 636\u2013666. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_23"},{"key":"14_CR40","doi-asserted-by":"crossref","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput. 17(2) (1988)","DOI":"10.1137\/0217022"},{"key":"14_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-14623-7_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"HK Maji","year":"2010","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: A zero-one law for cryptographic complexity with respect to computational UC security. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 595\u2013612. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_32"},{"key":"14_CR42","doi-asserted-by":"publisher","unstructured":"Maurer, U.M.: Abstract models of computation in cryptography (invited paper). In: Smart, N.P. (ed.) 10th IMA International Conference on Cryptography and Coding. LNCS, vol.\u00a03796, pp. 1\u201312. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11586821_1","DOI":"10.1007\/11586821_1"},{"key":"14_CR43","doi-asserted-by":"publisher","unstructured":"McQuoid, I., Rosulek, M., Roy, L.: Minimal symmetric PAKE and 1-out-of-N OT from programmable-once public functions. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 425\u2013442. ACM Press (2020). https:\/\/doi.org\/10.1145\/3372297.3417870","DOI":"10.1145\/3372297.3417870"},{"key":"14_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-56877-1_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"P Miao","year":"2020","unstructured":"Miao, P., Patel, S., Raykova, M., Seth, K., Yung, M.: Two-sided malicious security for private intersection-sum with cardinality. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 3\u201333. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_1"},{"key":"14_CR45","unstructured":"Mitsunari, S., Sakai, R., Kasahara, M.: A new traitor tracing. IEICE Trans. E85-A(2), 481\u2013484 (2002)"},{"key":"14_CR46","doi-asserted-by":"publisher","unstructured":"Naor, M., Pinkas, B., Reingold, O.: Distributed pseudo-random functions and KDCs. In: Stern, J. (ed.) EUROCRYPT\u201999. LNCS, vol.\u00a01592, pp. 327\u2013346. Springer, Berlin, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_23","DOI":"10.1007\/3-540-48910-X_23"},{"key":"14_CR47","unstructured":"Pu, S., Gao, J., Trieu, N.: Malicious private set union with two-sided output. Cryptology ePrint Archive, Paper 2026\/204 (2026). https:\/\/eprint.iacr.org\/2026\/204"},{"key":"14_CR48","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.) ACM CCS 2022, pp. 2505\u20132517. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560658","DOI":"10.1145\/3548606.3560658"},{"key":"14_CR49","doi-asserted-by":"publisher","unstructured":"Rosulek, M., Trieu, N.: Compact and malicious private set intersection for small sets. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 1166\u20131181. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484778","DOI":"10.1145\/3460120.3484778"},{"key":"14_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"14_CR51","unstructured":"Tu, B., Bai, Y., Zhang, C., Cao, Y., Chen, Y.: Fast enhanced private set union in the balanced and unbalanced scenarios. Cryptology ePrint Archive, to appear at USENIX 2025 (2025)"},{"key":"14_CR52","unstructured":"Vaillant, L.: The elligator map and inverse map. https:\/\/elligator.org\/map"},{"key":"14_CR53","doi-asserted-by":"crossref","unstructured":"Yang, Y., et al.: Maliciously secure circuit private set intersection via SPDZ-compatible oblivious PRF. PoPETS 2025, to appear (2024). https:\/\/eprint.iacr.org\/2024\/789","DOI":"10.56553\/popets-2025-0082"},{"key":"14_CR54","unstructured":"Zhang, C., Chen, Y., Liu, W., Zhang, M., Lin, D.: Linear private set union from multi-query reverse private membership test. In: Calandrino, J.A., Troncoso, C. (eds.) USENIX Security 2023, pp. 337\u2013354. USENIX Association (2023)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25317-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:41:18Z","timestamp":1778085678000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25317-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253163","9783032253170"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25317-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 May 2026","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":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}