{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T19:00:05Z","timestamp":1767985205021,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":38,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819609437","type":"print"},{"value":"9789819609444","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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-981-96-0944-4_2","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T05:53:44Z","timestamp":1733896424000},"page":"35-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Don\u2019t Use it Twice! Solving Relaxed Linear Equivalence Problems"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Budroni","sequence":"first","affiliation":[]},{"given":"Jes\u00fas-Javier","family":"Chi-Dom\u00ednguez","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"D\u2019Alconzo","sequence":"additional","affiliation":[]},{"given":"Antonio J.","family":"Di Scala","sequence":"additional","affiliation":[]},{"given":"Mukul","family":"Kulkarni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Alamati, N., De Feo, L., Montgomery, H., Patranabis, S.: Cryptographic group actions and applications. In: Moriai and Wang [26], pp. 411\u2013439. https:\/\/doi.org\/10.1007\/978-3-030-64834-3_14","DOI":"10.1007\/978-3-030-64834-3_14"},{"key":"2_CR2","unstructured":"Baldi, M., Beckwith, A.B.L., Biasse, J.F., Esser, A., Gaj, K., Mohajerani, K., Pelosi, G., Persichetti, E., Saarinen, M.J.O., Santini, P., Wallace, R.: LESS (version 1.1). Tech. rep., National Institute of Standards and Technology (2023), https:\/\/www.less-project.com\/"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Bardet, M., Otmani, A., Saeed-Taha, M.: Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial. In: 2019 IEEE International Symposium on Information Theory (ISIT). pp. 2464\u20132468 (2019).https:\/\/doi.org\/10.1109\/ISIT.2019.8849855","DOI":"10.1109\/ISIT.2019.8849855"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1080\/23799927.2022.2048206","volume":"7","author":"A Barenghi","year":"2022","unstructured":"Barenghi, A., Biasse, J., Ngo, T., Persichetti, E., Santini, P.: Advanced signature functionalities from the code equivalence problem. International Journal of Computer Mathematics: Computer Systems Theory 7(2), 112\u2013128 (2022). https:\/\/doi.org\/10.1080\/23799927.2022.2048206","journal-title":"International Journal of Computer Mathematics: Computer Systems Theory"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.3934\/amc.2022064","volume":"17","author":"A Barenghi","year":"2023","unstructured":"Barenghi, A., Biasse, J.F., Persichetti, E., Santini, P.: On the computational hardness of the code equivalence problem in cryptography. Advances in Mathematics of Communications 17(1), 23\u201355 (2023). https:\/\/doi.org\/10.3934\/amc.2022064","journal-title":"Advances in Mathematics of Communications"},{"key":"2_CR6","unstructured":"Battagliola, M., Borin, G., Meneghetti, A., Persichetti, E.: Cutting the GRASS: Threshold GRoup Action Signature Schemes. Cryptology ePrint Archive, Paper 2023\/859 (2023), https:\/\/eprint.iacr.org\/2023\/859"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Battagliola, M., Borin, G., Meneghetti, A., Persichetti, E.: Cutting the grass: Threshold group action signature schemes. In: Oswald, E. (ed.) Topics in Cryptology \u2013 CT-RSA 2024. pp. 460\u2013489. Springer Nature Switzerland, Cham (2024), https:\/\/doi.org\/10.1007\/978-3-031-58868-6_18","DOI":"10.1007\/978-3-031-58868-6_18"},{"key":"2_CR8","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: International Conference on Post-Quantum Cryptography. pp. 170\u2013201. Springer (2024),https:\/\/doi.org\/10.1007\/978-3-031-62743-9_6","DOI":"10.1007\/978-3-031-62743-9_6"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Beullens, W.: Not enough LESS: An improved algorithm for solving code equivalence problems over $$\\mathbb{F}_q$$. In: International Conference on Selected Areas in Cryptography. pp. 387\u2013403. Springer (2020),https:\/\/doi.org\/10.1007\/978-3-030-81652-0_15","DOI":"10.1007\/978-3-030-81652-0_15"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Beullens, W., Katsumata, S., Pintore, F.: Calamari and Falafl: Logarithmic (linkable) ring signatures from isogenies and lattices. In: Moriai and Wang [26], pp. 464\u2013492.https:\/\/doi.org\/10.1007\/978-3-030-64834-3_16","DOI":"10.1007\/978-3-030-64834-3_16"},{"key":"2_CR11","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, Heidelberg (Jul 2020).https:\/\/doi.org\/10.1007\/978-3-030-51938-4_3","DOI":"10.1007\/978-3-030-51938-4_3"},{"key":"2_CR12","unstructured":"Bos, J.W., Bronchain, O., Ducas, L., Fehr, S., Huang, Y.H., Pornin, T., Postlethwaite, E.W., Prest, T., Pulles, L.N., van Woerden, W.: Hawk version 1.0 (june 1, 2023). Tech. rep., National Institute of Standards and Technology (2023), https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/hawk-spec-web.pdf"},{"key":"2_CR13","unstructured":"Budroni, A., Chi-Dom\u00ednguez, J.J., D\u2019Alconzo, G., Di Scala, A.J., Kulkarni, M.: relaxed-lce-algorithms, available at https:\/\/github.com\/JJChiDguez\/relaxed-lce-algorithms.git"},{"key":"2_CR14","unstructured":"Chavez-Saab, J., Santos, M.C.R., Feo, L.D., Eriksen, J.K., Hess, B., Kohel, D., Leroux, A., Longa, P., Meyer, M., Panny, L., Patranabis, S., Petit, C., Henr\u00edquez, F.R., Schaeffler, S., Wesolowski, B.: Sqisign version 1.0 (june 1, 2023). Tech. rep., National Institute of Standards and Technology (2023), https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/sqisign-spec-web.pdf"},{"key":"2_CR15","unstructured":"Chou, T., Niederhagen, R., Persichetti, E., Ran, L., Hajatiana, T., Reijnders, K., Samardjiska, S., Trimoska, M.: MEDS (version 1.1). Tech. rep., National Institute of Standards and Technology (2023), https:\/\/www.meds-pqc.org\/"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Chou, T., Niederhagen, R., Persichetti, E., Randrianarisoa, T.H., Reijnders, K., Samardjiska, S., Trimoska, M.: Take your MEDS: digital signatures from matrix code equivalence. In: Mrabet, N.E., Feo, L.D., Duquesne, S. (eds.) Progress in Cryptology - AFRICACRYPT 2023 - 14th International Conference on Cryptology in Africa, Sousse, Tunisia, July 19-21, 2023, Proceedings. Lecture Notes in Computer Science, vol. 14064, pp. 28\u201352. Springer (2023).https:\/\/doi.org\/10.1007\/978-3-031-37679-5_2","DOI":"10.1007\/978-3-031-37679-5_2"},{"key":"2_CR17","unstructured":"Chou, T., Persichetti, E., Santini, P.: On Linear Equivalence, Canonical Forms, and Digital Signatures. Cryptology ePrint Archive, Paper 2023\/1533 (2023), https:\/\/eprint.iacr.org\/2023\/1533"},{"key":"2_CR18","unstructured":"Couveignes, J.M.: Hard homogeneous spaces. Cryptology ePrint Archive, Report 2006\/291 (2006), https:\/\/eprint.iacr.org\/2006\/291"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"D\u2019Alconzo, G., Di Scala, A.J.: Representations of group actions and their applications in cryptography. Finite Fields and Their Applications 99, 102476 (2024). https:\/\/doi.org\/10.1016\/j.ffa.2024.102476","DOI":"10.1016\/j.ffa.2024.102476"},{"key":"2_CR20","unstructured":"Gaborit, P., Otmani, A.: TABLES OF SELF-DUAL CODES, available at https:\/\/www.unilim.fr\/pages_perso\/philippe.gaborit\/SD\/"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Gaborit, P., Otmani, A.: Experimental constructions of self-dual codes. Finite Fields and Their Applications 9(3), 372\u2013394 (2003). https:\/\/doi.org\/10.1016\/S1071-5797(03)00011-X","DOI":"10.1016\/S1071-5797(03)00011-X"},{"key":"2_CR22","unstructured":"Joux, A.: MPC in the head for isomorphisms and group actions. Cryptology ePrint Archive, Paper 2023\/664 (2023), https:\/\/eprint.iacr.org\/2023\/664"},{"key":"2_CR23","unstructured":"Kazmi, R.A.: Cryptography from post-quantum assumptions. Cryptology ePrint Archive, Report 2015\/376 (2015), https:\/\/eprint.iacr.org\/2015\/376"},{"issue":"3","key":"2_CR24","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1109\/TIT.1982.1056498","volume":"28","author":"J Leon","year":"1982","unstructured":"Leon, J.: Computing automorphism groups of error-correcting codes. IEEE Transactions on Information Theory 28(3), 496\u2013511 (1982). https:\/\/doi.org\/10.1109\/TIT.1982.1056498","journal-title":"IEEE Transactions on Information Theory"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Leroux, A., Rom\u00e9as, M.: Updatable encryption from group actions. In: International Conference on Post-Quantum Cryptography. pp. 20\u201353. Springer (2024), https:\/\/doi.org\/10.1007\/978-3-031-62746-0_2","DOI":"10.1007\/978-3-031-62746-0_2"},{"key":"2_CR26","volume-title":"ASIACRYPT 2020, Part II, LNCS","year":"2020","unstructured":"Moriai, S., Wang, H. (eds.): ASIACRYPT 2020, Part II, LNCS, vol. 12492. Springer, Heidelberg (Dec (2020)"},{"key":"2_CR27","unstructured":"National Institute of Standards and Technology: Post-Quantum Cryptography Standardization. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography (2017)"},{"key":"2_CR28","unstructured":"National Institute of Standards and Technology: Post-quantum cryptography: Digital signature schemes. Round 1 Additional Signatures (2023), https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures"},{"issue":"2","key":"2_CR29","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2478\/tmmp-2022-0018","volume":"82","author":"E Persichetti","year":"2023","unstructured":"Persichetti, E., Randrianariso, T.H., Santini, P.: An attack on a non-interactive key exchange from code equivalence. Tatra Mountains Mathematical Publications 82(2), 53\u201364 (2023). https:\/\/doi.org\/10.2478\/tmmp-2022-0018","journal-title":"Tatra Mountains Mathematical Publications"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Persichetti, E., Santini, P.: A New Formulation of the Linear Equivalence Problem and Shorter LESS Signatures. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2023. pp. 351\u2013378. Springer Nature Singapore, Singapore (2023), https:\/\/doi.org\/10.1007\/978-981-99-8739-9_12","DOI":"10.1007\/978-981-99-8739-9_12"},{"issue":"5","key":"2_CR31","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1109\/18.623157","volume":"43","author":"E Petrank","year":"1997","unstructured":"Petrank, E., Roth, R.M.: Is code equivalence easy to decide? IEEE Transactions on Information Theory 43(5), 1602\u20131604 (1997). https:\/\/doi.org\/10.1109\/18.623157","journal-title":"IEEE Transactions on Information Theory"},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Reijnders, K., Samardjiska, S., Trimoska, M.: Hardness Estimates of the Code Equivalence Problem in the Rank Metric. Designs, Codes and Cryptography pp. 1\u201330 (01 2024). https:\/\/doi.org\/10.1007\/s10623-023-01338-x","DOI":"10.1007\/s10623-023-01338-x"},{"key":"2_CR33","unstructured":"Saeed, M.A.: Algebraic Approach for Code Equivalence. Ph.D. thesis, Normandie Universit\u00e9, University of Khartoum, (2017), Available at https:\/\/theses.hal.science\/tel-01678829v2"},{"issue":"3","key":"2_CR34","doi-asserted-by":"publisher","first-page":"2254","DOI":"10.1109\/TIT.2023.3323068","volume":"70","author":"P Santini","year":"2024","unstructured":"Santini, P., Baldi, M., Chiaraluce, F.: Computational hardness of the permuted kernel and subcode equivalence problems. IEEE Transactions on Information Theory 70(3), 2254\u20132270 (2024). https:\/\/doi.org\/10.1109\/TIT.2023.3323068","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2_CR35","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1137\/S0895480195294027","volume":"10","author":"N Sendrier","year":"1997","unstructured":"Sendrier, N.: On the dimension of the hull. SIAM Journal on Discrete Mathematics 10(2), 282\u2013293 (1997). https:\/\/doi.org\/10.1137\/S0895480195294027","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"4","key":"2_CR36","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N Sendrier","year":"2000","unstructured":"Sendrier, N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Transactions on Information Theory 46(4), 1193\u20131203 (2000). https:\/\/doi.org\/10.1109\/18.850662","journal-title":"IEEE Transactions on Information Theory"},{"key":"2_CR37","doi-asserted-by":"publisher","unstructured":"Sendrier, N., Simos, D.E.: The hardness of code equivalence over $$\\mathbb{F}_{q}$$ and its application to code-based cryptography. In: Gaborit, P. (ed.) Post-Quantum Cryptography - 5th International Workshop, PQCrypto 2013. pp. 203\u2013216. Springer Heidelberg (June 2013), https:\/\/doi.org\/10.1007\/978-3-642-38616-9_14","DOI":"10.1007\/978-3-642-38616-9_14"},{"key":"2_CR38","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 9.8) (2023), https:\/\/www.sagemath.org"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0944-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T06:11:45Z","timestamp":1733897505000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0944-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609437","9789819609444"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0944-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","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":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}