{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:14:38Z","timestamp":1767982478056,"version":"3.49.0"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031911231","type":"print"},{"value":"9783031911248","type":"electronic"}],"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-031-91124-8_5","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T09:22:43Z","timestamp":1745745763000},"page":"124-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Re-randomize and\u00a0Extract: A Novel Commitment Construction Framework Based on\u00a0Group Actions"],"prefix":"10.1007","author":[{"given":"Kaijie","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hengyi","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoxiao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanbin","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-030-64834-3_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"N Alamati","year":"2020","unstructured":"Alamati, N., De Feo, L., Montgomery, H., Patranabis, S.: Cryptographic Group Actions and Applications. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part II. LNCS, vol. 12492, pp. 411\u2013439. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_14"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Bannai, E.: Positive Definite Unimodular Lattices with Trivial Automorphism Groups, vol.\u00a0429. American Mathematical Soc. (1990)","DOI":"10.1090\/memo\/0429"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22792-9_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"B Barak","year":"2011","unstructured":"Barak, B., Dodis, Y., Krawczyk, H., Pereira, O., Pietrzak, K., Standaert, F.-X., Yu, Yu.: Leftover hash lemma, revisited. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 1\u201320. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_1"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Ben\u010dina, B., Budroni, A., Chi-Dom\u00ednguez, J.J., Kulkarni, M.: Properties of lattice isomorphism as a cryptographic group action. In: Saarinen, M.J., Smith-Tone, D. (eds.) PQCrypto 2024, Part\u00a0I, vol. 14771, pp. 170\u2013201. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62743-9_6","DOI":"10.1007\/978-3-031-62743-9_6"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Bennett, H., Ganju, A., Peetathawatchai, P., Stephens-Davidowitz, N.: Just how hard are rotations of $$\\mathbb{Z}^n$$? algorithms and cryptography with the simplest lattice. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 252\u2013281. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_9","DOI":"10.1007\/978-3-031-30589-4_9"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Beullens, W., Dobson, S., Katsumata, S., Lai, Y.F., Pintore, F.: Group signatures and more from isogenies and lattices: generic, simple, and efficient. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13276, pp. 95\u2013126. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_4","DOI":"10.1007\/978-3-031-07085-3_4"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Biasse, J.F., Micheli, G., Persichetti, E., Santini, P.: LESS is more: code-based signatures without syndromes. In: Nitaj, A., Youssef, A.M. (eds.) AFRICACRYPT 20. LNCS, vol. 12174, pp. 45\u201365. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51938-4_3","DOI":"10.1007\/978-3-030-51938-4_3"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 575\u2013584. ACM Press, June 2013. https:\/\/doi.org\/10.1145\/2488608.2488680","DOI":"10.1145\/2488608.2488680"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-38424-3_7","volume-title":"Advances in Cryptology-CRYPT0\u2019 90","author":"G Brassard","year":"1991","unstructured":"Brassard, G., Yung, M.: One-way group actions. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 94\u2013107. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-38424-3_7"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-03332-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"W Castryck","year":"2018","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/11523468_25","volume-title":"Automata, Languages and Programming","author":"D Catalano","year":"2005","unstructured":"Catalano, D., Visconti, I.: Hybrid trapdoor commitments and their applications. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 298\u2013310. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_25"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Chenevier, G.: Statistics for kneser p-neighbors. arXiv preprint arXiv:2104.06846 (2021)","DOI":"10.24033\/bsmf.2852"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Conway, J.H., Sloane, N.J.A.: Sphere Packings, Lattices and Groups, Grundlehren der mathematischen Wissenschaften, vol.\u00a0290. Springer (1988). https:\/\/doi.org\/10.1007\/978-1-4757-2016-7","DOI":"10.1007\/978-1-4757-2016-7"},{"key":"5_CR14","unstructured":"Couveignes, J.M.: Hard homogeneous spaces (2006)"},{"key":"5_CR15","unstructured":"Cr\u00e9peau, C., Stuart, J.: Zero-knowledge mips using homomorphic commitment schemes. arXiv preprint arXiv:2304.09784 (2023)"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"D\u2019Alconzo, G., Flamini, A., Gangemi, A.: Non-interactive commitment from non-transitive group actions. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0VII. LNCS, vol. 14444, pp. 222\u2013252. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8739-9_8","DOI":"10.1007\/978-981-99-8739-9_8"},{"issue":"158","key":"5_CR17","first-page":"2","volume":"6","author":"A Darwish","year":"2017","unstructured":"Darwish, A., El-Gendy, M.M.: A new cryptographic voting verifiable scheme for e-voting system based on bit commitment and blind signature. Int. J. Swarm Intel. Evol. Comput. 6(158), 2 (2017)","journal-title":"Int. J. Swarm Intel. Evol. Comput."},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Ducas, L., Gibbons, S.: Hull attacks on the lattice isomorphism problem. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023, Part\u00a0I. LNCS, vol. 13940, pp. 177\u2013204. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_7","DOI":"10.1007\/978-3-031-31368-4_7"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Ducas, L., van Woerden, W.P.J.: On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0III. LNCS, vol. 13277, pp. 643\u2013673. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_23","DOI":"10.1007\/978-3-031-07082-2_23"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"El Kaafarani, A., Katsumata, S., Pintore, F.: Lossy CSI-FiSh: efficient signature scheme with tight reduction to decisional CSIDH-512. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC\u00a02020, Part\u00a0II. LNCS, vol. 12111, pp. 157\u2013186. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_6","DOI":"10.1007\/978-3-030-45388-6_6"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-319-76578-5_20","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"TK Frederiksen","year":"2018","unstructured":"Frederiksen, T.K., Pinkas, B., Yanai, A.: Committed MPC. In: Abdalla, M., Dahab, R. (eds.) PKC 2018, Part I. LNCS, vol. 10769, pp. 587\u2013619. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76578-5_20"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 197\u2013206. ACM Press, May 2008. https:\/\/doi.org\/10.1145\/1374376.1374407","DOI":"10.1145\/1374376.1374407"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Gilchrist, V., Marco, L., Petit, C., Tang, G.: Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an asiacrypt 2023 commitment scheme. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0I. LNCS, vol. 14920, pp. 141\u2013173. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_5","DOI":"10.1007\/978-3-031-68376-3_5"},{"issue":"3","key":"5_CR24","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. J. Cryptol. 9(3), 167\u2013190 (1996). https:\/\/doi.org\/10.1007\/s001459900010","journal-title":"J. Cryptol."},{"issue":"3","key":"5_CR25","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. ACM 38(3), 691\u2013729 (1991). https:\/\/doi.org\/10.1145\/116825.116852","journal-title":"J. ACM"},{"key":"5_CR26","unstructured":"Groth, J.: Homomorphic trapdoor commitments to group elements. Cryptology ePrint Archive, Report 2009\/007 (2009). https:\/\/eprint.iacr.org\/2009\/007"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Gupte, A., Vaikuntanathan, V.: How to construct quantum FHE, generically. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0III. LNCS, vol. 14922, pp. 246\u2013279. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_8","DOI":"10.1007\/978-3-031-68382-4_8"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-68697-5_16","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201996","author":"S Halevi","year":"1996","unstructured":"Halevi, S., Micali, S.: Practical and provably-secure commitment schemes from collision-free hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 201\u2013215. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_16"},{"key":"5_CR29","doi-asserted-by":"publisher","unstructured":"Haviv, I., Regev, O.: On the lattice isomorphism problem. In: Chekuri, C. (ed.) 25th SODA, pp. 391\u2013404. ACM-SIAM, January 2014. https:\/\/doi.org\/10.1137\/1.9781611973402.29","DOI":"10.1137\/1.9781611973402.29"},{"key":"5_CR30","unstructured":"Hein, J.: Orthogonal modular forms: an application to a conjecture of birch, algorithms and computations. Dartmouth College (2016)"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-36030-6_11","volume-title":"Theory of Cryptography","author":"Z Ji","year":"2019","unstructured":"Ji, Z., Qiao, Y., Song, F., Yun, A.: General linear group action on tensors: a candidate for post-quantum cryptography. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 251\u2013281. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_11"},{"key":"5_CR32","doi-asserted-by":"publisher","unstructured":"Jiang, K., Wang, A., Luo, H., Liu, G., Yu, Y., Wang, X.: Exploiting the symmetry of $$\\mathbb{Z}^n$$: Randomization and the automorphism problem. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0IV. LNCS, vol. 14441, pp. 167\u2013200. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8730-6_6","DOI":"10.1007\/978-981-99-8730-6_6"},{"key":"5_CR33","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Lai, Y.F., LeGrow, J.T., Qin, L.: CSI-Otter: Isogeny-based (partially) blind signatures from the class group action with a twist. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0III. LNCS, vol. 14083, pp. 729\u2013761. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_24","DOI":"10.1007\/978-3-031-38548-3_24"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-26954-8_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"F Kitagawa","year":"2019","unstructured":"Kitagawa, F., Matsuda, T., Tanaka, K.: CCA security and trapdoor functions via key-dependent-message security. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 33\u201364. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_2"},{"key":"5_CR35","doi-asserted-by":"publisher","unstructured":"Lai, Y.F.: Capybara and Tsubaki: verifiable random functions from group actions and isogenies. CiC 1(3), 1 (2024). https:\/\/doi.org\/10.62056\/avr-11zn4","DOI":"10.62056\/avr-11zn4"},{"issue":"3","key":"5_CR36","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1007\/s00145-016-9235-7","volume":"30","author":"HW Lenstra","year":"2016","unstructured":"Lenstra, H.W., Silverberg, A.: Lattices with Symmetry. J. Cryptol. 30(3), 760\u2013804 (2016). https:\/\/doi.org\/10.1007\/s00145-016-9235-7","journal-title":"J. Cryptol."},{"issue":"1","key":"5_CR37","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1137\/0210002","volume":"10","author":"A Lubiw","year":"1981","unstructured":"Lubiw, A.: Some np-complete problems similar to graph isomorphism. SIAM J. Comput. 10(1), 11\u201321 (1981)","journal-title":"SIAM J. Comput."},{"key":"5_CR38","doi-asserted-by":"publisher","unstructured":"Luo, H., Jiang, K., Pan, Y., Wang, A.: Cryptanalysis of rank-2 module-LIP with symplectic automorphisms. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT\u00a02024, Part\u00a0IV. LNCS, vol. 15487, pp. 359\u2013385. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_12","DOI":"10.1007\/978-981-96-0894-2_12"},{"key":"5_CR39","doi-asserted-by":"publisher","unstructured":"Mathon, R.: A note on the graph isomorphism counting problem. Inf. Process. Lett. 8(3), 131\u2013132 (1979). https:\/\/doi.org\/10.1016\/0020-0190(79)90004-8","DOI":"10.1016\/0020-0190(79)90004-8"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of lattice problems - a cryptographic perspective, The Kluwer international series in engineering and computer science, vol.\u00a0671. Springer (2002)","DOI":"10.1007\/978-1-4615-0897-7_8"},{"issue":"2","key":"5_CR41","first-page":"24","volume":"3","author":"H Montgomery","year":"2023","unstructured":"Montgomery, H., Patranabis, S.: A computational category-theoretic approach to cryptography and average-case complexity. Math. Cryptol. 3(2), 24\u201352 (2023)","journal-title":"Math. Cryptol."},{"issue":"2","key":"5_CR42","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptol. 4(2), 151\u2013158 (1991). https:\/\/doi.org\/10.1007\/BF00196774","journal-title":"J. Cryptol."},{"key":"5_CR43","doi-asserted-by":"publisher","unstructured":"Pan, J., Wagner, B.: Lattice-based signatures with tight adaptive corruptions and more. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC\u00a02022, Part\u00a0II. LNCS, vol. 13178, pp. 347\u2013378. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97131-1_12","DOI":"10.1007\/978-3-030-97131-1_12"},{"issue":"2","key":"5_CR44","first-page":"40","volume":"1","author":"B Sterner","year":"2021","unstructured":"Sterner, B.: Commitment schemes from supersingular elliptic curve isogeny graphs. Math. Cryptol. 1(2), 40\u201351 (2021)","journal-title":"Math. Cryptol."},{"key":"5_CR45","doi-asserted-by":"publisher","unstructured":"Tang, G., Duong, D.H., Joux, A., Plantard, T., Qiao, Y., Susilo, W.: Practical post-quantum signature schemes from isomorphism problems of trilinear forms. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0III. LNCS, vol. 13277, pp. 582\u2013612. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_21","DOI":"10.1007\/978-3-031-07082-2_21"},{"key":"5_CR46","doi-asserted-by":"publisher","unstructured":"van Woerden, W.P.J.: Dense and smooth lattices in any genus. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT\u00a02024, Part\u00a0IV. LNCS, vol. 15487, pp. 386\u2013417. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_13","DOI":"10.1007\/978-981-96-0894-2_13"},{"issue":"4","key":"5_CR47","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1016\/j.disc.2016.11.023","volume":"340","author":"J Wang","year":"2017","unstructured":"Wang, J.: A note on unimodular lattices with trivial automorphism groups. Discret. Math. 340(4), 763\u2013765 (2017)","journal-title":"Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91124-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T09:22:46Z","timestamp":1745745766000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91124-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031911231","9783031911248"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91124-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 April 2025","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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}