Biscuit: new MPCitH signature scheme from structured multivariate polynomials

DOI10.1007/978-3-031-54770-6_18MaRDI QIDQ6547993FDOQ6547993

Authors: Luk Bettale, Delaram Kahrobaei, Ludovic Perret, Javier A. Verbel 

Publication date: 31 May 2024

Recommendations

• Building MPCitH-based signatures from MQ, MinRank, and rank SD
• MI-T-HFE, a new multivariate signature scheme
• The return of the SDitH
• Multivariate Signature Scheme Using Quadratic Forms
• A multivariate based threshold ring signature scheme

zbMATH Keywords

cryptographycryptanalysismultivariate polynomialsdigital signaturepost-quantum

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• New Algorithms for Learning in Presence of Errors
• Solving polynomial systems over finite fields: improved analysis of the hybrid approach
• On lattices, learning with errors, random linear codes, and cryptography
• Hybrid approach for solving multivariate systems over finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of solving quadratic Boolean systems
• Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
• The return of the SDitH
• An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
• An estimator for the hardness of the MQ problem

Cited In (1)

• MPC in the head using the subfield bilinear collision problem

This page was built for publication: Biscuit: new MPCitH signature scheme from structured multivariate polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547993)