{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:04:27Z","timestamp":1757624667294,"version":"3.44.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032018830"},{"type":"electronic","value":"9783032018847"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-01884-7_7","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T09:31:09Z","timestamp":1755336669000},"page":"207-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Pseudorandom Correlation Generators over\u00a0$$\\mathbb {Z}\/p^k\\mathbb {Z}$$"],"prefix":"10.1007","author":[{"given":"Zhe","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yizhou","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"7_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-031-68397-8_11","volume-title":"CRYPTO 2024","author":"A Agarwal","year":"2024","unstructured":"Agarwal, A., Boyle, E., Gilboa, N., Ishai, Y., Kelkar, M., Ma, Y.: Compressing unit-vector correlations via sparse pseudorandom generators. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14927, pp. 346\u2013383. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68397-8_11"},{"key":"7_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-031-15985-5_12","volume-title":"CRYPTO 2022","author":"C Baum","year":"2022","unstructured":"Baum, C., Braun, L., Munch-Hansen, A., Scholl, P.: Moz $$\\mathbb{Z} _{2^k}$$arella: efficient vector-OLE and zero-knowledge proofs over $$\\mathbb{Z} _{2^k}$$. In: CRYPTO 2022. LNCS, vol. 13510, pp. 329\u2013358. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_12"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.3233\/JCS-200116","volume":"30","author":"C Baum","year":"2022","unstructured":"Baum, C., Escudero, D., Pedrouzo-Ulloa, A., Scholl, P., Troncoso-Pastoriza, J.R.: Efficient protocols for oblivious linear function evaluation from ring-LWE. J. Comput. Secur. 30(1), 39\u201378 (2022). https:\/\/doi.org\/10.3233\/JCS-200116","journal-title":"J. Comput. Secur."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-20465-4_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"R Bendlin","year":"2011","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 169\u2013188. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-48329-2_24","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"A Blum","year":"1994","unstructured":"Blum, A., Furst, M., Kearns, M., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 278\u2013291. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_24"},{"key":"7_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-981-96-0938-3_3","volume-title":"ASIACRYPT 2024","author":"M Bombar","year":"2024","unstructured":"Bombar, M., Bui, D., Couteau, G., Couvreur, A., Ducros, C., Servan-Schreiber, S.: FOLEAGE: $$\\mathbb{F} _4$$ OLE-based multi-party computation for Boolean circuits. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT 2024. LNCS, vol. 15489, pp. 69\u2013101. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-981-96-0938-3_3"},{"key":"7_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/978-3-031-38551-3_18","volume-title":"CRYPTO 2023","author":"M Bombar","year":"2023","unstructured":"Bombar, M., Couteau, G., Couvreur, A., Ducros, C.: Correlated pseudorandomness from the hardness of quasi-abelian decoding. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14084, pp. 567\u2013601. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_18"},{"key":"7_CR9","unstructured":"Bouillaguet, C., Delaplace, C., Hamdad, M., Vergnaud, D.: Practical cryptanalysis of pseudorandom correlation generators based on quasi-abelian syndrome decoding. Cryptology ePrint Archive, Paper 2025\/892 (2025). https:\/\/eprint.iacr.org\/2025\/892"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: CCS 2018, pp. 896\u2013912. ACM (2018). https:\/\/doi.org\/10.1145\/3243734.3243868","DOI":"10.1145\/3243734.3243868"},{"key":"7_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/978-3-031-15979-4_21","volume-title":"CRYPTO 2022","author":"E Boyle","year":"2022","unstructured":"Boyle, E., et al.: Correlated pseudorandomness from expand-accumulate codes. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508, pp. 603\u2013633. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_21"},{"key":"7_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-031-30545-0_10","volume-title":"EUROCRYPT 2023","author":"E Boyle","year":"2023","unstructured":"Boyle, E., et al.: Oblivious transfer with constant computational overhead. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14004, pp. 271\u2013302. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_10"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: CCS 2019, pp. 291\u2013308. ACM (2019). https:\/\/doi.org\/10.1145\/3319535.3354255","DOI":"10.1145\/3319535.3354255"},{"key":"7_CR14","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":"7_CR15","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Correlated pseudorandom functions from variable-density LPN. In: Irani, S. (ed.) FOCS 2020, pp. 1069\u20131080. IEEE (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00103","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"7_CR16","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":"7_CR17","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Hamilis, M., Ishai, Y., Tu, Y.: Improved constructions for distributed multi-point functions. In: 2025 IEEE Symposium on Security and Privacy (SP), p. 44. IEEE Computer Society (2024)","DOI":"10.1109\/SP61157.2025.00044"},{"key":"7_CR18","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":"7_CR19","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: improvements and extensions. In: CCS 2016, pp. 1292\u20131303. ACM (2016). https:\/\/doi.org\/10.1145\/2976749.2978429","DOI":"10.1145\/2976749.2978429"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-030-45388-6_13","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"D Catalano","year":"2020","unstructured":"Catalano, D., Di Raimondo, M., Fiore, D., Giacomelli, I.: Mon$$\\mathbb{Z}_{2^{k}}$$a: fast maliciously secure two party computation on $$\\mathbb{Z}_{2^{k}}$$. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 357\u2013386. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_13"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-030-84245-1_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"JH Cheon","year":"2021","unstructured":"Cheon, J.H., Kim, D., Lee, K.: MHz2k: MPC from HE over $$\\mathbb{Z}_{2^k}$$ with\u00a0new packing, simpler reshare, and\u00a0better ZKP. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 426\u2013456. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_15"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/978-3-319-96881-0_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"R Cramer","year":"2018","unstructured":"Cramer, R., Damg\u00e5rd, I., Escudero, D., Scholl, P., Xing, C.: SPD$$\\mathbb{Z}_{2^k}$$: efficient MPC mod $$2^k$$ for dishonest majority. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 769\u2013798. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_26"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Escudero, D., Frederiksen, T.K., Keller, M., Scholl, P., Volgushev, N.: New primitives for actively-secure MPC over rings with applications to private machine learning. In: IEEE Symposium on Security and Privacy, pp. 1102\u20131120. IEEE (2019)","DOI":"10.1109\/SP.2019.00078"},{"key":"7_CR24","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":"7_CR25","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-031-15802-5_14","volume-title":"CRYPTO 2022","author":"D Escudero","year":"2022","unstructured":"Escudero, D., Xing, C., Yuan, C.: More efficient dishonest majority secure computation over $$\\mathbb{Z} _{2^k}$$ via Galois rings. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13507, pp. 383\u2013412. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_14"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/978-3-642-55220-5_35","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"N Gilboa","year":"2014","unstructured":"Gilboa, N., Ishai, Y.: Distributed point functions and their applications. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 640\u2013658. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_35"},{"key":"7_CR27","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-031-30545-0_12","volume-title":"EUROCRYPT 2023","author":"X Guo","year":"2023","unstructured":"Guo, X., et al.: Half-tree: halving the cost of tree expansion in COT and DPF. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14004, pp. 330\u2013362. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_12"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-34047-5_20","volume-title":"Fast Software Encryption","author":"S Heyse","year":"2012","unstructured":"Heyse, S., Kiltz, E., Lyubashevsky, V., Paar, C., Pietrzak, K.: Lapin: an efficient authentication protocol based on ring-LPN. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 346\u2013365. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_20"},{"issue":"2","key":"7_CR29","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1090\/S0002-9947-1966-0210699-5","volume":"122","author":"G Janusz","year":"1966","unstructured":"Janusz, G.: Separable algebras over commutative rings. Trans. Am. Math. Soc. 122(2), 461\u2013479 (1966)","journal-title":"Trans. Am. Math. Soc."},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) CCS 2016, pp. 830\u2013842. ACM (2016). https:\/\/doi.org\/10.1145\/2976749.2978357","DOI":"10.1145\/2976749.2978357"},{"key":"7_CR31","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-031-91092-0_6","volume-title":"EUROCRYPT 2025","author":"Z Li","year":"2025","unstructured":"Li, Z., Xing, C., Yao, Y., Yuan, C.: Efficient pseudorandom correlation generators for any finite field. In: Fehr, S., Fouque, P. (eds.) EUROCRYPT 2025. LNCS, vol. 15605, pp. 145\u2013175. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91092-0_6"},{"key":"7_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-031-68400-5_13","volume-title":"Advances in Cryptology","author":"F Lin","year":"2024","unstructured":"Lin, F., Xing, C., Yao, Y.: More efficient zero-knowledge protocols over $$\\mathbb{Z} _{2^k}$$ via Galois rings. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14928, pp. 424\u2013457. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68400-5_13"},{"key":"7_CR33","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-031-58751-1_6","volume-title":"Advances in Cryptology","author":"H Liu","year":"2024","unstructured":"Liu, H., Wang, X., Yang, K., Yu, Y.: The hardness of LPN over any integer ring and field for PCG applications. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14656, pp. 149\u2013179. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_6"},{"key":"7_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-030-40186-3_12","volume-title":"Topics in Cryptology \u2013 CT-RSA 2020","author":"E Orsini","year":"2020","unstructured":"Orsini, E., Smart, N.P., Vercauteren, F.: Overdrive2k: efficient secure MPC over $$\\mathbb{Z}_{2^k}$$ from somewhat homomorphic encryption. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 254\u2013283. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_12"},{"key":"7_CR35","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/978-3-031-38551-3_19","volume-title":"CRYPTO 2023","author":"S Raghuraman","year":"2023","unstructured":"Raghuraman, S., Rindal, P., Tanguy, T.: Expand-convolute codes for pseudorandom correlation generators from LPN. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14084, pp. 602\u2013632. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_19"},{"key":"7_CR36","doi-asserted-by":"publisher","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., Raykova, M.: Distributed vector-OLE: improved constructions and implementation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) CCS 2019, pp. 1055\u20131072. ACM (2019). https:\/\/doi.org\/10.1145\/3319535.3363228","DOI":"10.1145\/3319535.3363228"},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Wan, Z.X.: Lectures on finite fields and Galois rings (2003)","DOI":"10.1142\/5350"},{"key":"7_CR38","doi-asserted-by":"publisher","unstructured":"Yang, K., Weng, C., Lan, X., Zhang, J., Wang, X.: Ferret: fast extension for correlated OT with small communication. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) CCS 2020, pp. 1607\u20131626. ACM (2020). https:\/\/doi.org\/10.1145\/3372297.3417276","DOI":"10.1145\/3372297.3417276"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01884-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T14:59:09Z","timestamp":1757429949000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01884-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018830","9783032018847"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01884-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","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":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}