{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T10:31:43Z","timestamp":1765103503602,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":45,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551217","type":"print"},{"value":"9789819551224","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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-5122-4_5","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T10:28:48Z","timestamp":1765103328000},"page":"131-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Carousel: Fully Homomorphic Encryption with\u00a0Bootstrapping over\u00a0Automorphism Group"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-3870-2096","authenticated-orcid":false,"given":"Intak","family":"Hwang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1151-2453","authenticated-orcid":false,"given":"Seonhong","family":"Min","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0496-9789","authenticated-orcid":false,"given":"Yongsoo","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-319-78556-1_7","volume-title":"Information Security and Cryptology \u2013 ICISC 2017","author":"S Arita","year":"2018","unstructured":"Arita, S., Handa, S.: Subring homomorphic encryption. In: Kim, H., Kim, D.-C. (eds.) ICISC 2017. LNCS, vol. 10779, pp. 112\u2013136. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78556-1_7"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1587\/transfun.2019CIP0027","volume":"103","author":"S Arita","year":"2020","unstructured":"Arita, S., Handa, S.: Fully homomorphic encryption scheme based on decomposition ring. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103(1), 195\u2013211 (2020)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Alexandru, A., Kim, A., Polyakov, Y.: General functional bootstrapping using CKKS. Cryptology ePrint Archive (2024)","DOI":"10.1007\/978-3-032-01881-6_10"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-662-44371-2_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"J Alperin-Sheriff","year":"2014","unstructured":"Alperin-Sheriff, J., Peikert, C.: Faster bootstrapping with polynomial error. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 297\u2013314. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_17"},{"key":"5_CR5","unstructured":"Al Badawi, A., et al.: OpenFHE: open-source fully homomorphic encryption library. Cryptology ePrint Archive, Paper 2022\/915 (2022). https:\/\/eprint.iacr.org\/2022\/915"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Bae, Y., Cheon, J.H., Kim, J., Park, J.H., Stehl\u00e9, D.: HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14084, pp. 37\u201369. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_2","DOI":"10.1007\/978-3-031-38551-3_2"},{"issue":"10","key":"5_CR7","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1145\/364096.364118","volume":"11","author":"GD Bergland","year":"1968","unstructured":"Bergland, G.D.: Numerical analysis: a fast Fourier transform algorithm for real-valued series. Commun. ACM 11(10), 703\u2013710 (1968)","journal-title":"Commun. ACM"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: Fast norm computation in smooth-degree abelian number fields. Res. Number Theory 9(4), 82 (2023)","DOI":"10.1007\/s40993-022-00402-0"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Bae, Y., Kim, J., Stehl\u00e9, D., Suvanto, E.: Bootstrapping small integers With CKKS. In: Chung, KM., Sasaki, Y. (eds.) ASIACRYPT 2024. LNCS, vol. 15484, pp. 330\u2013360. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_11","DOI":"10.1007\/978-981-96-0875-1_11"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Clet, PE., Boudguiga, A., Sirdey, R., Zuber, M.: ComBo: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain. In: El Mrabet, N., De Feo, L., Duquesne, S. (eds.) AFRICACRYPT 2023. LNCS, vol. 14064, pp. 317\u2013343. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37679-5_14","DOI":"10.1007\/978-3-031-37679-5_14"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-030-78372-3_18","volume-title":"Applied Cryptography and Network Security","author":"H Chen","year":"2021","unstructured":"Chen, H., Dai, W., Kim, M., Song, Y.: Efficient homomorphic conversion between (ring) LWE ciphertexts. In: Sako, K., Tippenhauer, N.O. (eds.) ACNS 2021. LNCS, vol. 12726, pp. 460\u2013479. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78372-3_18"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2020)","journal-title":"J. Cryptol."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Cha, H., Hwang, I., Min, S., Seo, J., Song, Y.: Matrigear: accelerating authenticated matrix triple generation with scalable prime fields via optimized he packing. In: 2025 IEEE Symposium on Security and Privacy (SP), pp. 2249\u20132267. IEEE Computer Society (2025)","DOI":"10.1109\/SP61157.2025.00174"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"JH Cheon","year":"2017","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/978-3-030-92078-4_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"I Chillotti","year":"2021","unstructured":"Chillotti, I., Ligier, D., Orfila, J.-B., Tap, S.: Improved programmable bootstrapping with\u00a0larger precision and\u00a0efficient arithmetic circuits for\u00a0TFHE. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part III. LNCS, vol. 13092, pp. 670\u2013699. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_23"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/978-3-030-92078-4_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"I Chillotti","year":"2021","unstructured":"Chillotti, I., Ligier, D., Orfila, J.-B., Tap, S.: Improved programmable bootstrapping with\u00a0larger precision and\u00a0efficient arithmetic circuits for\u00a0TFHE. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 670\u2013699. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_23"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"L Ducas","year":"2015","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 617\u2013640. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24"},{"key":"5_CR20","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Paper 2012\/144 (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-662-49896-5_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"N Gama","year":"2016","unstructured":"Gama, N., Izabach\u00e8ne, M., Nguyen, P.Q., Xie, X.: Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 528\u2013558. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_19"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"5_CR24","unstructured":"Hwang, I., Min, S., Song, Y.: Practical circuit privacy\/sanitization for TFHE. Cryptology ePrint Archive (2025)"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-662-44371-2_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S Halevi","year":"2014","unstructured":"Halevi, S., Shoup, V.: Algorithms in HElib. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 554\u2013571. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_31"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Joye, M., Paillier, P.: Blind rotation in fully homomorphic encryption with extended keys. In: Dolev, S., Katz, J., Meisels, A. (eds.) CSCML 2022. LNCS, vol. 13301, pp. 1\u201318. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07689-3_1","DOI":"10.1007\/978-3-031-07689-3_1"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Joye, M., Walter, M.: Liberating TFHE: programmable bootstrapping with general quotient polynomials. In: Proceedings of the 10th Workshop on Encrypted Computing and Applied Homomorphic Cryptography, pp. 1\u201311 (2022)","DOI":"10.1145\/3560827.3563376"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-12146-4_6","volume-title":"Information Security and Cryptology \u2013 ICISC 2018","author":"D Kim","year":"2019","unstructured":"Kim, D., Song, Y.: Approximate homomorphic encryption over the conjugate-invariant ring. In: Lee, K. (ed.) ICISC 2018. LNCS, vol. 11396, pp. 85\u2013102. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12146-4_6"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Kluczniak, K., Schild, L.: FDFB: full domain functional bootstrapping towards practical fully homomorphic encryption. IACR Trans. Cryptogr. Hardw. Embed. Syst. (2023)","DOI":"10.46586\/tches.v2023.i1.501-537"},{"key":"5_CR30","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-031-30620-4_8","volume-title":"EUROCRYPT 2023","author":"Y Lee","year":"2023","unstructured":"Lee, Y., et al.: Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14006, pp. 227\u2013256. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_8"},{"key":"5_CR31","unstructured":"Lee, D., Min, S., Song, Y.: Functional bootstrapping for packed ciphertexts via homomorphic LUT evaluation. Cryptology ePrint Archive (2024)"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Lee, C., Min, S., Seo, J., Song, Y.: Faster TFHE bootstrapping with block binary keys. In: Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, pp. 2\u201313 (2023)","DOI":"10.1145\/3579856.3595804"},{"issue":"6","key":"5_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM (JACM) 60(6), 1\u201335 (2013)","journal-title":"J. ACM (JACM)"},{"key":"5_CR34","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-031-30620-4_11","volume-title":"EUROCRYPT 2023","author":"FH Liu","year":"2023","unstructured":"Liu, F.H., Wang, H.: Batch bootstrapping I: a new framework for SIMD bootstrapping in polynomial modulus. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14006, pp. 321\u2013352. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_11"},{"key":"5_CR35","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-031-30620-4_12","volume-title":"EUROCRYPT 2023","author":"FH Liu","year":"2023","unstructured":"Liu, F.H., Wang, H.: Batch bootstrapping II: bootstrapping in polynomial modulus only requires o(1) FHE multiplications in amortization. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14006, pp. 353\u2013384. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_12"},{"key":"5_CR36","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-981-96-0875-1_7","volume-title":"ASIACRYPT 2024","author":"Z Liu","year":"2025","unstructured":"Liu, Z., Wang, Y.: Relaxed functional bootstrapping: a new perspective on BGV\/BFV bootstrapping. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT 2024. LNCS, vol. 15484, pp. 208\u2013240. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_7"},{"key":"5_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-030-84245-1_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"A May","year":"2021","unstructured":"May, A.: How to meet ternary LWE keys. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 701\u2013731. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_24"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Ma, S., Huang, T., Wang, A., Zhou, Q., Wang, X.: Fast and accurate: efficient full-domain functional bootstrap and digit decomposition for homomorphic computation. IACR Trans. Cryptogr. Hardw. Embed. Syst. (2024)","DOI":"10.46586\/tches.v2024.i1.592-616"},{"key":"5_CR39","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-981-99-8736-8_3","volume-title":"ASIACRYPT 2023","author":"H Okada","year":"2023","unstructured":"Okada, H., Player, R., Pohmann, S.: Homomorphic polynomial evaluation using Galois structure and applications to BFV bootstrapping. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14443, pp. 69\u2013100. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8736-8_3"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Rader, C.M.: Discrete Fourier transforms when the number of data samples is prime. Proc. IEEE 56(6), 1107\u20131108 (1968)","DOI":"10.1109\/PROC.1968.6477"},{"issue":"6","key":"5_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (JACM) 56(6), 1\u201340 (2009)","journal-title":"J. ACM (JACM)"},{"key":"5_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-10366-7_36","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"D Stehl\u00e9","year":"2009","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 617\u2013635. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_36"},{"key":"5_CR43","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-031-58723-8_12","volume-title":"EUROCRYPT 2024","author":"R Wang","year":"2024","unstructured":"Wang, R., et al.: Circuit bootstrapping: faster and smaller. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024. LNCS, vol. 14652, pp. 342\u2013372. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_12"},{"key":"5_CR44","unstructured":"Yang, Z., Xie, X., Shen, H., Chen, S., Zhou, J.: Tota: fully homomorphic encryption with smaller parameters and stronger security. Cryptology ePrint Archive (2021)"},{"key":"5_CR45","unstructured":"Zama: TFHE-rs: A Pure Rust Implementation of the TFHE Scheme for Boolean and Integer Arithmetics Over Encrypted Data (2022). https:\/\/github.com\/zama-ai\/tfhe-rs"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5122-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T10:28:50Z","timestamp":1765103330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5122-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551217","9789819551224"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5122-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}