{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T22:35:13Z","timestamp":1775774113149,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":39,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819608874","type":"print"},{"value":"9789819608881","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"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-0888-1_2","type":"book-chapter","created":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T09:09:53Z","timestamp":1733821793000},"page":"38-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Dual Support Decomposition in\u00a0the\u00a0Head: Shorter Signatures from\u00a0Rank SD and\u00a0MinRank"],"prefix":"10.1007","author":[{"given":"Lo\u00efc","family":"Bidoux","sequence":"first","affiliation":[]},{"given":"Thibauld","family":"Feneuil","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[]},{"given":"Romaric","family":"Neveu","sequence":"additional","affiliation":[]},{"given":"Matthieu","family":"Rivain","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,11]]},"reference":[{"key":"2_CR1","unstructured":"Gora Adj, Stefano Barbero, Emanuele Bellini, Andre Esser, Luis Rivera-Zamarripa, Carlo Sanna, Javier Verbel, and Floyd Zweydinger. MiRitH. NIST\u2019s Post-Quantum Cryptography Standardization of Additional Digital Signature Schemes Project (Round 1), https:\/\/pqc-mirith.org\/, 2023."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Gora Adj, Luis Rivera-Zamarripa, and Javier Verbel. Minrank in the head. In Nadia El\u00a0Mrabet, Luca De\u00a0Feo, and Sylvain Duquesne, editors, Progress in Cryptology - AFRICACRYPT 2023, pages 3\u201327, Cham, 2023. Springer Nature Switzerland.","DOI":"10.1007\/978-3-031-37679-5_1"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Carlos Aguilar Melchor, Nicolas Gama, James Howe, Andreas H\u00fclsing, David Joseph, and Dongze Yue. The Return of the SDitH. In Carmit Hazay and Martijn Stam, editors, Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part V, volume 14008 of Lecture Notes in Computer Science, pages 564\u2013596. Springer, 2023.","DOI":"10.1007\/978-3-031-30589-4_20"},{"key":"2_CR4","unstructured":"Nicolas Aragon, Magali Bardet, Lo\u00efc Bidoux, Jes\u00fas-Javier Chi-Dom\u00ednguez, Victor Dyseryn, Thibauld Feneuil, Philippe Gaborit, Antoine Joux, Matthieu Rivain, Jean-Pierre Tillich, and Adrien Vincotte. RYDE. NIST\u2019s Post-Quantum Cryptography Standardization of Additional Digital Signature Schemes Project (Round 1), https:\/\/pqc-ryde.org\/, 2023."},{"key":"2_CR5","unstructured":"Nicolas Aragon, Magali Bardet, Lo\u00efc Bidoux, Jes\u00fas-Javier Chi-Dom\u00ednguez, Victor Dyseryn, Thibauld Feneuil, Philippe Gaborit, Romaric Neveu, Matthieu Rivain, and Jean-Pierre Tillich. MIRA. NIST\u2019s Post-Quantum Cryptography Standardization of Additional Digital Signature Schemes Project (Round 1), https:\/\/pqc-mira.org\/, 2023."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Nicolas Aragon, Philippe Gaborit, Adrien Hauteville, and Jean-Pierre Tillich. A New Algorithm for Solving the Rank Syndrome Decoding Problem. In 2018 IEEE International Symposium on Information Theory (ISIT), pages 2421\u20132425, 2018.","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, Vincent Neiger, Olivier Ruatta, and Jean-Pierre Tillich. An Algebraic Attack on Rank Metric Code-Based Cryptosystems. In Anne Canteaut and Yuval Ishai, editors, Advances in Cryptology \u2013 EUROCRYPT 2020, pages 64\u201393, Cham, 2020. Springer International Publishing.","DOI":"10.1007\/978-3-030-45727-3_3"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, and Jean-Pierre Tillich. Revisiting algebraic attacks on MinRank and on the rank decoding problem. Designs, Codes and Cryptography, 91:3671-3707, 2023.","DOI":"10.1007\/s10623-023-01265-x"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Magali Bardet, Maxime Bros, Daniel Cabarcas, Philippe Gaborit, Ray Perlner, Daniel Smith-Tone, Jean-Pierre Tillich, and Javier Verbel. Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems. In Shiho Moriai and Huaxiong Wang, editors, Advances in Cryptology \u2013 ASIACRYPT 2020, pages 507\u2013536, Cham, 2020. Springer International Publishing.","DOI":"10.1007\/978-3-030-64837-4_17"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Magali Bardet, Maxime Bros, Daniel Cabarcas, Philippe Gaborit, Ray Perlner, Daniel Smith-Tone, Jean-Pierre Tillich, and Javier Verbel. Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems. In Advances in Cryptology \u2013 ASIACRYPT 2020, pages 507\u2013536. Springer International Publishing, 2020.","DOI":"10.1007\/978-3-030-64837-4_17"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Carsten Baum, Ward Beullens, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, and Peter Scholl. One tree to rule them all: Optimizing ggm trees and owfs for post-quantum signatures. Cryptology ePrint Archive, Paper 2024\/490, 2024. https:\/\/eprint.iacr.org\/2024\/490.","DOI":"10.1007\/978-981-96-0875-1_15"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Carsten Baum, Lennart Braun, Cyprien\u00a0Delpech de\u00a0Saint\u00a0Guilhem, Michael Kloo\u00df, Emmanuela Orsini, Lawrence Roy, and Peter Scholl. Publicly verifiable zero-knowledge and post-quantum signatures from vole-in-the-head. In Helena Handschuh and Anna Lysyanskaya, editors, Advances in Cryptology \u2013 CRYPTO 2023, pages 581\u2013615, Cham, 2023. Springer Nature Switzerland.","DOI":"10.1007\/978-3-031-38554-4_19"},{"key":"2_CR13","unstructured":"Carsten Baum, Lennart Braun, Cyprien\u00a0Delpech de\u00a0Saint\u00a0Guilhem, Michael Kloo\u00df, Christian Majenz, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, and Peter Scholl. FAEST. NIST\u2019s Post-Quantum Cryptography Standardization of Additional Digital Signature Schemes Project (Round 1), https:\/\/faest.info\/, 2023."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Emanuele Bellini, Andre Esser, Carlo Sanna, and Javier Verbel. Mr-dss - smaller minrank-based (ring-)signatures. In Post-Quantum Cryptography: 13th International Workshop, PQCrypto 2022, Virtual Event, September 28-30, 2022, Proceedings, page 144-169, Berlin, Heidelberg, 2022. Springer-Verlag.","DOI":"10.1007\/978-3-031-17234-2_8"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Lo\u00efc Bidoux and Philippe Gaborit. Compact Post-quantum Signatures from Proofs of Knowledge Leveraging Structure for the PKP, SD and RSD Problems. In Codes, Cryptology and Information Security (C2SI), 2023.","DOI":"10.1007\/978-3-031-33017-9_2"},{"key":"2_CR16","unstructured":"Lo\u00efc Bidoux, Thibauld Feneuil, Philippe Gaborit, Romaric Neveu, and Matthieu Rivain. Dual support decomposition in the head: Shorter signatures from rank SD and MinRank. Cryptology ePrint Archive, Paper 2024\/541, 2024."},{"key":"2_CR17","unstructured":"Nicolas Courtois. La s\u00e9curit\u00e9 des primitives cryptographiques bas\u00e9es sur des probl\u00e8mes alg\u00e9briques multivariables mq, ip, minrank, hfe, 2001."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Nicolas\u00a0T. Courtois. Efficient zero-knowledge authentication based on a linear algebra problem minrank. In Colin Boyd, editor, Advances in Cryptology \u2014 ASIACRYPT 2001, pages 402\u2013421, Berlin, Heidelberg, 2001. Springer Berlin Heidelberg.","DOI":"10.1007\/3-540-45682-1_24"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, and Titouan Tanguy. Limbo: Efficient Zero-knowledge MPCitH-based Arguments. In Yongdae Kim, Jong Kim, Giovanni Vigna, and Elaine Shi, editors, CCS \u201921: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15 - 19, 2021, pages 3022\u20133036. ACM, 2021.","DOI":"10.1145\/3460120.3484595"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Thibauld Feneuil. Building MPCitH-based signatures from MQ, MinRank, Rank SD and PKP. In International Conference on Applied Cryptography and Network Security (ACNS), 2024.","DOI":"10.1007\/978-3-031-54770-6_16"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Thibauld Feneuil, Antoine Joux, and Matthieu Rivain. Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature. Designs, Codes and Cryptography, 91:563\u2013608, 2022.","DOI":"10.1007\/s10623-022-01116-1"},{"key":"2_CR22","unstructured":"Thibauld Feneuil and Matthieu Rivain. Threshold Computation in the Head: Improved Framework for Post-Quantum Signatures and Zero-Knowledge Arguments. Cryptology ePrint Archive, Report 2023\/1573, 2023."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Thibauld Feneuil and Matthieu Rivain. Threshold Linear Secret Sharing to the Rescue of MPC-in-the-Head. In International Conference on the Theory and Application of Cryptology and Information Security (Asiacrypt), 2023.","DOI":"10.1007\/978-981-99-8721-4_14"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Andrew\u00a0M. Odlyzko, editor, Advances in Cryptology \u2014 CRYPTO\u2019 86, pages 186\u2013194, Berlin, Heidelberg, 1987. Springer Berlin Heidelberg.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions. J. ACM, 33(4):792-807, aug 1986.","DOI":"10.1145\/6490.6503"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Louis Goubin and Nicolas\u00a0T. Courtois. Cryptanalysis of the TTM Cryptosystem. In International Conference on the Theory and Application of Cryptology and Information Security, 2000.","DOI":"10.1007\/3-540-44448-3_4"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. Zero-knowledge from secure multiparty computation. In Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, STOC \u201907, page 21-30, New York, NY, USA, 2007. Association for Computing Machinery.","DOI":"10.1145\/1250790.1250794"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Jonathan Katz, Vladimir Kolesnikov, and Xiao Wang. Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures. In David Lie, Mohammad Mannan, Michael Backes, and XiaoFeng Wang, editors, Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, October 15-19, 2018, pages 525\u2013537. ACM, 2018.","DOI":"10.1145\/3243734.3243805"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Aviad Kipnis and Adi Shamir. Cryptanalysis of the HFE public key cryptosystem by relinearization. In crypto \u201999, volume 1666 of LNCS, pages 19\u201330, Santa Barbara, California, USA, August 1999. Springer.","DOI":"10.1007\/3-540-48405-1_2"},{"key":"2_CR30","unstructured":"P.\u00a0Loidreau. Properties of codes in rank metric, 2006."},{"key":"2_CR31","unstructured":"Carlos\u00a0Aguilar Melchior, Nicolas Aragon, Slim Bettaieb, Lo\u00efc Bidoux, Olivier Blazy, Maxime Bros, Alain Couvreur, Jean-Christophe Deneuville, Philippe Gaborit, Adrien Hauteville, and Gilles Z\u00e9mor. RQC. NIST\u2019s Post-Quantum Cryptography Standardization Process, https:\/\/pqc-rqc.org\/, 2017."},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Ralph\u00a0C. Merkle. A digital signature based on a conventional encryption function. In Carl Pomerance, editor, Advances in Cryptology \u2014 CRYPTO \u201987, pages 369\u2013378, Berlin, Heidelberg, 1988. Springer Berlin Heidelberg.","DOI":"10.1007\/3-540-48184-2_32"},{"key":"2_CR33","unstructured":"NIST. Call for Additional Digital Signature Schemes for the Post-Quantum Cryptography Standardization Process, 2022. https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/call-for-proposals-dig-sig-sept-2022.pdf."},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"A.\u00a0V. Ourivski and T.\u00a0Johansson. New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications. Probl. Inf. Transm., 38(3):237-246, jul 2002.","DOI":"10.1023\/A:1020369320078"},{"key":"2_CR35","unstructured":"Bagus Santoso, Yasuhiko Ikematsu, Shuhei Nakamura, and Takanori Yasuda. Three-pass identification scheme based on minrank problem with half cheating probability, 2022."},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Adi Shamir. How to share a secret. Commun. ACM, 22(11):612-613, nov 1979.","DOI":"10.1145\/359168.359176"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Jacques Stern. A new identification scheme based on syndrome decoding. In International Cryptology Conference (CRYPTO), 1993.","DOI":"10.1007\/3-540-48329-2_2"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Pascal V\u00e9ron. Improved Identification Schemes Based on Error-Correcting Codes. Applicable Algebra in Engineering, Communication and Computing, 8(1), January 1997.","DOI":"10.1007\/s002000050053"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Kang Yang, Pratik Sarkar, Chenkai Weng, and Xiao Wang. Quicksilver: Efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201921, page 2986-3001, New York, NY, USA, 2021. Association for Computing Machinery.","DOI":"10.1145\/3460120.3484556"}],"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-0888-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T09:35:21Z","timestamp":1733823321000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0888-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,11]]},"ISBN":["9789819608874","9789819608881"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0888-1_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,11]]},"assertion":[{"value":"11 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"}}]}}