{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T13:01:24Z","timestamp":1784638884989,"version":"3.55.0"},"publisher-location":"Cham","reference-count":64,"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_18","type":"book-chapter","created":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T12:06:06Z","timestamp":1784635566000},"page":"501-527","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SoK: Outsourced Private Set Intersection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6063-3939","authenticated-orcid":false,"given":"Sophie","family":"Hawkes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4906-6871","authenticated-orcid":false,"given":"Christian","family":"Weinert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,22]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, A., Dong, C., Murdoch, S.J., Terzis, S.: Multi-party Updatable Delegated Private Set Intersection. In: FC. LNCS, vol. 13411, pp. 100\u2013119. Springer (2022)","DOI":"10.1007\/978-3-031-18283-9_6"},{"key":"18_CR2","unstructured":"Abadi, A., et al.: Starlit: privacy-preserving federated learning to enhance financial fraud detection. IACR ePrint https:\/\/ia.cr\/2024\/90"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Abadi, A., Terzis, S., Dong, C.: O-PSI: delegated private set intersection on outsourced datasets. In: SEC. IFIP AICT, vol.\u00a0455, pp. 3\u201317. Springer (2015)","DOI":"10.1007\/978-3-319-18467-8_1"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Abadi, A., Terzis, S., Dong, C.: VD-PSI: verifiable delegated private set intersection on outsourced private datasets. In: FC. LNCS, vol.\u00a09603, pp. 149\u2013168. Springer (2016)","DOI":"10.1007\/978-3-662-54970-4_9"},{"issue":"4","key":"18_CR5","first-page":"608","volume":"16","author":"A Abadi","year":"2019","unstructured":"Abadi, A., Terzis, S., Metere, R., Dong, C.: Efficient delegated private set intersection on outsourced private datasets. IEEE TDSC 16(4), 608\u2013624 (2019)","journal-title":"IEEE TDSC"},{"key":"18_CR6","unstructured":"Asharov, G., Hamada, K., Kikuchi, R., Nof, A., Pinkas, B., Tomida, J.: Secure statistical analysis on multiple datasets: join and group-by. In: CCS, pp. 3298\u20133312. ACM (2023)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer and extensions for faster secure computation. In: CCS, pp. 535\u2013548. ACM (2013)","DOI":"10.1145\/2508859.2516738"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In: CCS, pp. 7\u201317. ACM (1997)","DOI":"10.1145\/266420.266426"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"van Baarsen, A., Pu, S.: Fuzzy private set intersection with large hyperballs. In: EUROCRYPT. LNCS, vol. 14655, pp. 340\u2013369. Springer (2024)","DOI":"10.1007\/978-3-031-58740-5_12"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: TCC. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer (2005)","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"18_CR12","first-page":"4504","volume":"18","author":"Y Chen","year":"2023","unstructured":"Chen, Y., Huang, K.: JEDI: Joint and effective privacy preserving outsourced set intersection and data integration protocols. IEEE TIFS 18, 4504\u20134514 (2023)","journal-title":"IEEE TIFS"},{"key":"18_CR13","unstructured":"Chung, H., Kim, M., Yang, P.C.: Multiparty delegated private set union with efficient updates on outsourced datasets. In: IEEE TDSC, pp. 1\u201316 (2024)"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Debnath, S.K., Sakurai, K., Dey, K., Kundu, N.: Secure outsourced private set intersection with linear complexity. In: DSC, pp.\u00a01\u20138. IEEE (2021)","DOI":"10.1109\/DSC49826.2021.9346230"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-39256-6_9","volume-title":"Data and Applications Security and Privacy XXVII","author":"C Dong","year":"2013","unstructured":"Dong, C., Chen, L., Camenisch, J., Russello, G.: Fair private set intersection with a semi-trusted arbiter. In: Wang, L., Shafiq, B. (eds.) DBSec 2013. LNCS, vol. 7964, pp. 128\u2013144. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39256-6_9"},{"key":"18_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. LNCS, vol. 12493, pp. 870\u2013899. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_29"},{"issue":"6","key":"18_CR17","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. CACM 28(6), 637\u2013647 (1985)","journal-title":"CACM"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Fan, C., et al.: Cloud-assisted private set intersection via multi-key fully homomorphic encryption. Mathematics 11(8) (2023)","DOI":"10.3390\/math11081784"},{"key":"18_CR19","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":"18_CR20","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. LNCS, vol. 12826, pp. 395\u2013425. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_14"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Garimella, G., Rosulek, M., Singh, J.: Structure-aware private set intersection, with applications to fuzzy matching. In: CRYPTO. LNCS, vol. 13507, pp. 323\u2013352. Springer (2022)","DOI":"10.1007\/978-3-031-15802-5_12"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Garimella, G., Rosulek, M., Singh, J.: Malicious secure, structure-aware private set intersection. In: CRYPTO. LNCS, vol. 14081, pp. 577\u2013610. Springer (2023)","DOI":"10.1007\/978-3-031-38557-5_19"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography \u2013 Volume 1: Basic Tools. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"18_CR24","unstructured":"Goldreich, O.: The Foundations of Cryptography \u2013 Volume 2: Basic Applications. Cambridge University Press (2004)"},{"issue":"2","key":"18_CR25","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR26","volume":"65","author":"AA Jolfaei","year":"2022","unstructured":"Jolfaei, A.A., Mala, H., Zarezadeh, M.: EO-PSI-CA: efficient outsourced private set intersection cardinality. J. Inf. Secur. Appl. 65, 102996 (2022)","journal-title":"J. Inf. Secur. Appl."},{"key":"18_CR27","unstructured":"Kamara, S., Mohassel, P., Raykova, M.: Outsourcing multi-party computation. IACR ePrint https:\/\/ia.cr\/2011\/272"},{"key":"18_CR28","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":"18_CR29","doi-asserted-by":"crossref","unstructured":"Kavousi, A., Mohajeri, J., Salmasizadeh, M.: Improved secure efficient delegated private set intersection. In: ICEE, pp.\u00a01\u20136. IEEE (2020)","DOI":"10.1109\/ICEE50131.2020.9260663"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F.: Collusion-resistant outsourcing of private set intersection. In: SAC, pp. 1451\u20131456. ACM (2012)","DOI":"10.1145\/2245276.2232008"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F.: Outsourced private set intersection using homomorphic encryption. In: ASIACCS, pp. 85\u201386. ACM (2012)","DOI":"10.1145\/2414456.2414506"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: CCS, pp. 818\u2013829. ACM (2016)","DOI":"10.1145\/2976749.2978381"},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Li, Y., Ghosh, D., Gupta, P., Mehrotra, S., Panwar, N., Sharma, S.: PRISM: private verifiable set computation over multi-owner outsourced databases. In: SIGMOD, pp. 1116\u20131128. ACM (2021)","DOI":"10.1145\/3448016.3452839"},{"key":"18_CR34","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: How to simulate it - A tutorial on the simulation proof technique. In: Tutorials on the Foundations of Cryptography, pp. 277\u2013346. Springer International Publishing (2017)","DOI":"10.1007\/978-3-319-57048-8_6"},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"Liu, F., Ng, W.K., Zhang, W., Giang, D.H., Han, S.: Encrypted set intersection protocol for outsourced datasets. In: IC2E, pp. 135\u2013140. IEEE (2014)","DOI":"10.1109\/IC2E.2014.18"},{"issue":"5","key":"18_CR36","doi-asserted-by":"publisher","first-page":"8007","DOI":"10.1109\/TII.2023.3342882","volume":"20","author":"Z Liu","year":"2024","unstructured":"Liu, Z., Wang, L., Bao, H., Cao, Z., Zhou, L., Liu, Z.: Efficient and privacy-preserving cloud-assisted two-party computation scheme in heterogeneous networks. IEEE Trans. Ind. Informatics 20(5), 8007\u20138018 (2024)","journal-title":"IEEE Trans. Ind. Informatics"},{"key":"18_CR37","unstructured":"L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V.: Cloud-Assisted Multiparty Computation from Fully Homomorphic Encryption. IACR ePrint https:\/\/ia.cr\/2011\/663"},{"key":"18_CR38","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: STOC, pp. 1219\u20131234. ACM (2012)","DOI":"10.1145\/2213977.2214086"},{"key":"18_CR39","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 (1986)","DOI":"10.1109\/SP.1986.10022"},{"key":"18_CR40","doi-asserted-by":"crossref","unstructured":"Miyaji, A., Nakasho, K., Nishida, S.: Privacy-preserving integration of medical data - a practical multiparty private set intersection. J. Medical Syst. 41(3), 37:1\u201337:10 (2017)","DOI":"10.1007\/s10916-016-0657-4"},{"key":"18_CR41","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Rindal, P., Rosulek, M.: Fast database joins and PSI for secret shared data. In: CCS, pp. 1271\u20131287. ACM (2020)","DOI":"10.1145\/3372297.3423358"},{"key":"18_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2023.100567","volume":"49","author":"D Morales Escalera","year":"2023","unstructured":"Morales Escalera, D., Agudo, I., L\u00f3pez, J.: Private set intersection: a systematic literature review. Comput. Sci. Rev. 49, 100567 (2023)","journal-title":"Comput. Sci. Rev."},{"key":"18_CR43","doi-asserted-by":"crossref","unstructured":"Oliaee, M.M., Delavar, M., Ameri, M.H., Mohajeri, J., Aref, M.R.: On the security of O-PSI: a delegated private set intersection on outsourced datasets. In: ISCISC, pp. 77\u201381. IEEE (2017)","DOI":"10.1109\/ISCISC.2017.8488358"},{"key":"18_CR44","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Scalable private set intersection based on OT extension. ACM TOPS 21(2), 7:1\u20137:35 (2018)","DOI":"10.1145\/3154794"},{"key":"18_CR45","unstructured":"Rabin, M.O.: How To Exchange Secrets with Oblivious Transfer. Technical Report TR-81, Aiken Computation Lab, Harvard University (1981)"},{"key":"18_CR46","doi-asserted-by":"crossref","unstructured":"Raghuraman, S., Rindal, P.: Blazing fast PSI from improved OKVS and subfield VOLE. In: CCS, pp. 2505\u20132517. ACM (2022)","DOI":"10.1145\/3548606.3560658"},{"key":"18_CR47","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":"18_CR48","doi-asserted-by":"crossref","unstructured":"Ruan, O., Zeng, J.: A delegated offline private set intersection protocol for cloud computing environments. In: ICCIR, pp. 735\u2013739. ACM (2022)","DOI":"10.1145\/3548608.3559297"},{"key":"18_CR49","doi-asserted-by":"crossref","unstructured":"Sadat, M.N., Aziz, M.M.A., Mohammed, N., Pakhomov, S., Liu, H., Jiang, X.: A privacy-preserving distributed filtering framework for NLP artifacts. BMC Med. Inform. Decis. Mak. 19(1), 183:1\u2013183:10 (2019)","DOI":"10.1186\/s12911-019-0867-z"},{"key":"18_CR50","doi-asserted-by":"crossref","unstructured":"Sander, T., Young, A.L., Yung, M.: Non-Interactive CryptoComputing For NC$$ ^{\\text{1}}$$. In: FOCS, pp. 554\u2013567. IEEE (1999)","DOI":"10.1109\/SFFCS.1999.814630"},{"key":"18_CR51","doi-asserted-by":"crossref","unstructured":"Shakya, R., Yasumura, Y., Suzuki, T., Ishimaki, Y., Yamana, H.: Outsourced private set union on multi-attribute datasets for search protocol using fully homomorphic encryption. In: iiWAS, pp. 55\u201362. ACM (2019)","DOI":"10.1145\/3366030.3366059"},{"key":"18_CR52","doi-asserted-by":"crossref","unstructured":"Shi, Y., Yang, W., Xu, W., Li, Q.: Research on outsourced PSI protocols for privacy preserving data sharing. In: ICBDS. CCIS, vol.\u00a01563, pp. 125\u2013136. Springer (2021)","DOI":"10.1007\/978-981-19-0852-1_10"},{"key":"18_CR53","doi-asserted-by":"crossref","unstructured":"Son, Y., Jeong, J.: PSI with computation or circuit-PSI for unbalanced sets from homomorphic encryption. In: ASIACCS, pp. 342\u2013356. ACM (2023)","DOI":"10.1145\/3579856.3582817"},{"key":"18_CR54","doi-asserted-by":"crossref","unstructured":"Tajima, A., Sato, H., Yamana, H.: Outsourced private set intersection cardinality with fully homomorphic encryption. In: ICMCS, pp.\u00a01\u20138. IEEE (2018)","DOI":"10.1109\/ICMCS.2018.8525881"},{"key":"18_CR55","doi-asserted-by":"crossref","unstructured":"Vos, J., Conti, M., Erkin, Z.: Sok: Collusion-resistant multi-party private set intersections in the semi-honest model. In: SP, pp. 465\u2013483. IEEE (2024)","DOI":"10.1109\/SP54263.2024.00079"},{"key":"18_CR56","unstructured":"Wei, S., Hu, J.: Delegated PSI from homomorphic encryptions. IACR ePrint https:\/\/ia.cr\/2025\/868"},{"issue":"4","key":"18_CR57","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1109\/TC.2021.3067713","volume":"71","author":"Y Wu","year":"2022","unstructured":"Wu, Y., et al.: Elastic bloom filter: Deletable and expandable filter using elastic fingerprints. IEEE Trans. Computers 71(4), 984\u2013991 (2022)","journal-title":"IEEE Trans. Computers"},{"key":"18_CR58","doi-asserted-by":"crossref","unstructured":"Yang, X., Luo, X., Wang, X.A., Zhang, S.: Improved outsourced private set intersection protocol based on polynomial interpolation. CCPE 30(1) (2018)","DOI":"10.1002\/cpe.4329"},{"key":"18_CR59","doi-asserted-by":"crossref","unstructured":"Yeo, F.Y., Ying, J.H.M.: Third-party private set intersection. In: ISIT, pp. 1633\u20131638. IEEE (2023)","DOI":"10.1109\/ISIT54713.2023.10206690"},{"issue":"9","key":"18_CR60","first-page":"2893","volume":"91","author":"Y Zhan","year":"2023","unstructured":"Zhan, Y., Zhang, Z., Liu, Q., Wang, B.: Hiding the input-size in multi-party private set intersection. DESI 91(9), 2893\u20132915 (2023)","journal-title":"DESI"},{"key":"18_CR61","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.ins.2016.09.056","volume":"387","author":"E Zhang","year":"2017","unstructured":"Zhang, E., Li, F., Niu, B., Wang, Y.: Server-aided private set intersection based on reputation. Inf. Sci. 387, 180\u2013194 (2017)","journal-title":"Inf. Sci."},{"key":"18_CR62","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Wang, L., Zhou, L.: efficient updateable private set intersection on outsourced datasets. In: APWeb\/WAIM. LNCS, vol. 14964, pp. 84\u201399. Springer (2024)","DOI":"10.1007\/978-981-97-7241-4_6"},{"key":"18_CR63","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Chow, S.S.M.: Can you find the one for me? In: WPES@CCS, pp. 54\u201365. ACM (2018)","DOI":"10.1145\/3267323.3268965"},{"key":"18_CR64","doi-asserted-by":"crossref","unstructured":"Zheng, Q., Xu, S.: Verifiable delegated set intersection operations on outsourced encrypted data. In: IC2E, pp. 175\u2013184. IEEE (2015)","DOI":"10.1109\/IC2E.2015.38"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T12:06:30Z","timestamp":1784635590000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-32560-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,22]]},"ISBN":["9783032325594","9783032325600"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-32560-0_18","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"}}]}}