{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:18:34Z","timestamp":1766269114920,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031547690"},{"type":"electronic","value":"9783031547706"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-54770-6_18","type":"book-chapter","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T09:03:42Z","timestamp":1709197422000},"page":"457-486","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Biscuit: New MPCitH Signature Scheme from\u00a0Structured Multivariate Polynomials"],"prefix":"10.1007","author":[{"given":"Luk","family":"Bettale","sequence":"first","affiliation":[]},{"given":"Delaram","family":"Kahrobaei","sequence":"additional","affiliation":[]},{"given":"Ludovic","family":"Perret","sequence":"additional","affiliation":[]},{"given":"Javier","family":"Verbel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,1]]},"reference":[{"key":"18_CR1","unstructured":"NIST Call for Additional Digital Signature Schemes for the Post-Quantum Cryptography Standardization Process. https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/call-for-proposals-dig-sig-sept-2022.pdf"},{"key":"18_CR2","unstructured":"Biscuit github repository (2023). https:\/\/github.com\/BiscuitTeam\/Biscuit"},{"key":"18_CR3","unstructured":"Aaraj, N., et al.: PERK specification (2023). https:\/\/pqc-perk.org\/assets\/downloads\/PERK_specifications.pdf"},{"key":"18_CR4","unstructured":"Adj, G., et al.: MiRitH specification (2023). https:\/\/pqc-mirith.org\/assets\/downloads\/mirith_specifications_v1.0.0.pdf"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Melchor, C.A., Gama, N., Howe, J., H\u00fclsing, A., Joseph, D., Yue, D.: The return of the SDitH, pp. 564\u2013596 (2023)","DOI":"10.1007\/978-3-031-30589-4_20"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status report on the second round of the nist post-quantum cryptography standardization process. Technical report NISTIR 8309, NIST (2022). https:\/\/nvlpubs.nist.gov\/nistpubs\/ir\/2020\/NIST.IR.8309.pdf","DOI":"10.6028\/NIST.IR.8413"},{"key":"18_CR7","unstructured":"Albrecht, M.R., Cid, C., Faug\u00e8re, J.-C., Perret, L.: Algebraic algorithms for lwe. Cryptology ePrint Archive, Paper 2014\/1018 (2014). https:\/\/eprint.iacr.org\/2014\/1018"},{"key":"18_CR8","unstructured":"Aragon, N., et al.: RYDE specification (2023). https:\/\/pqc-ryde.org\/assets\/downloads\/RYDE_Specifications.pdf"},{"key":"18_CR9","unstructured":"Aragon, N., et al.: MIRA specification (2023). https:\/\/pqc-mira.org\/assets\/downloads\/mira_spec.pdf"},{"key":"18_CR10","unstructured":"Aragon, N., et al.: Mira: a digital signature scheme based on the minrank problem and the MPC-in-the-head paradigm (2023)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-22006-7_34","volume-title":"Automata, Languages and Programming","author":"S Arora","year":"2011","unstructured":"Arora, S., Ge, R.: New algorithms for learning in presence of errors. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 403\u2013415. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_34"},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.jco.2012.07.001","volume":"29","author":"M Bardet","year":"2013","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B., Spaenlehauer, P.-J.: On the complexity of solving quadratic Boolean systems. J. Complex. 29(1), 53\u201375 (2013)","journal-title":"J. Complex."},{"key":"18_CR13","unstructured":"Baum, C., et al.: FAEST specification (2023). https:\/\/faest.info\/faest-spec-v1.1.pdf"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-030-45374-9_17","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"C Baum","year":"2020","unstructured":"Baum, C., Nof, A.: Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12110, pp. 495\u2013526. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_17"},{"key":"18_CR15","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":"18_CR16","doi-asserted-by":"crossref","unstructured":"Bellini, E., Makarim, R.H., Sanna, C., Verbel, J.A.: An estimator for the hardness of the MQ problem, pp. 323\u2013347 (2022)","DOI":"10.1007\/978-3-031-17433-9_14"},{"issue":"3","key":"18_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1515\/JMC.2009.009","volume":"3","author":"L Bettale","year":"2009","unstructured":"Bettale, L., Faug\u00e8re, J.-C., Perret, L.: Hybrid approach for solving multivariate systems over finite fields. J. Math. Cryptol. 3(3), 177\u2013197 (2009)","journal-title":"J. Math. Cryptol."},{"key":"18_CR18","unstructured":"Bettale, L., Faug\u00e8re, J.-C., Perret, L.: Solving polynomial systems over finite fields: improved analysis of the hybrid approach. In: van der Hoeven, J., van Hoeij, M. (eds.) International Symposium on Symbolic and Algebraic Computation, ISSAC 2012, Grenoble, France - July 22\u201325, 2012, pp. 67\u201374. ACM (2012)"},{"key":"18_CR19","unstructured":"Bettale, L., Perret, L., Kahrobaei, D., Verbel, J.: Biscuit: shorter MPC-based Signature from PoSSo, June 2023. Specification of NIST post-quantum signature (2023)"},{"key":"18_CR20","unstructured":"Bouillaguet, C.: Improved security analysis of Biscuit (2023). https:\/\/groups.google.com\/a\/list.nist.gov\/g\/pqc-forum\/c\/sw8NueiNek0\/m\/2sa_emjABQAJ"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Chase, M., et al.: Post-quantum zero-knowledge and signatures from symmetric-key primitives, pp. 1825\u20131842 (2017)","DOI":"10.1145\/3133956.3133997"},{"key":"18_CR22","unstructured":"NIST Computer Security Division. SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. FIPS Publication 202, National Institute of Standards and Technology, U.S. Department of Commerce, May 2014"},{"key":"18_CR23","unstructured":"Esser, A., Verbel, J., Zweydinger, F., Bellini, E.: Cryptographic Estimators: a software library for cryptographic hardness estimation. Cryptology ePrint Archive, Paper 2023\/589, 2023. https:\/\/eprint.iacr.org\/2023\/589"},{"key":"18_CR24","unstructured":"Feneuil, T., Rivain, M.: MQOM specification (2023). https:\/\/mqom.org\/docs\/mqom-v1.0.pdf"},{"key":"18_CR25","unstructured":"Feneuil, T., Rivain, M.: Threshold computation in the head: improved framework for post-quantum signatures and zero-knowledge arguments. Cryptology ePrint Archive, Paper 2023\/1573 (2023). https:\/\/eprint.iacr.org\/2023\/1573"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO 1986","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"18_CR27","unstructured":"Giacomelli, I., Madsen, J., Orlandi, C.:. ZKBoo: faster zero-knowledge for boolean circuits. In: 25th USENIX Security Symposium (USENIX Security 16), pp. 1069\u20131083 (2016)"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 21\u201330 (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-65411-5_1","volume-title":"Cryptology and Network Security","author":"D Kales","year":"2020","unstructured":"Kales, D., Zaverucha, G.: An attack on some signature schemes constructed from five-pass identification schemes. In: Krenn, S., Shulman, H., Vaudenay, S. (eds.) CANS 2020. LNCS, vol. 12579, pp. 3\u201322. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65411-5_1"},{"key":"18_CR30","unstructured":"Kales, D., Zaverucha, G.: Efficient lifting for shorter zero-knowledge proofs and post-quantum signatures. Cryptology ePrint Archive, Paper 2022\/588 (2022). https:\/\/eprint.iacr.org\/2022\/588"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Katz, J., Kolesnikov, V., Wang, X.: Improved non-interactive zero-knowledge with applications to post-quantum signatures. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 525\u2013537 (2018)","DOI":"10.1145\/3243734.3243805"},{"key":"18_CR32","unstructured":"Kim, S., et al.: AIMER specification (2023). https:\/\/aimer-signature.org\/docs\/AIMer-NIST-Document.pdf"},{"key":"18_CR33","unstructured":"Melchor, C.A., et al.: SDITH specification (2023). https:\/\/sdith.org\/docs\/sdith-v1.0.pdf"},{"key":"18_CR34","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/978-3-031-30589-4_20","volume-title":"Advances in Cryptology EUROCRYPT 2023 Part V, LNCS","author":"CA Melchor","year":"2023","unstructured":"Melchor, C.A., Gama, N., Howe, J., H\u00fclsing, A., Joseph, D., Yue, D.: The return of the SDitH. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology EUROCRYPT 2023 Part V, LNCS, vol. 14008, pp. 564\u2013596. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_20"},{"issue":"6","key":"18_CR35","doi-asserted-by":"publisher","first-page":"34: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 56(6), 34:1-34:40 (2009)","journal-title":"J. ACM"},{"key":"18_CR36","unstructured":"Zaverucha, G., et al.: Picnic: algorithm specification and design document"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54770-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:15:14Z","timestamp":1709655314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54770-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031547690","9783031547706"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54770-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Abu Dhabi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","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":"5 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wp.nyu.edu\/acns2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"230","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}