Biscuit: new MPCitH signature scheme from structured multivariate polynomials
From MaRDI portal
Publication:6547993
Recommendations
Cites work
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
- An estimator for the hardness of the MQ problem
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- Hybrid approach for solving multivariate systems over finite fields
- New Algorithms for Learning in Presence of Errors
- On lattices, learning with errors, random linear codes, and cryptography
- On the complexity of solving quadratic Boolean systems
- Solving polynomial systems over finite fields: improved analysis of the hybrid approach
- The return of the SDitH
Cited in
(5)- MPC in the head using the subfield bilinear collision problem
- Modelling ciphers with overdefined systems of quadratic equations: application to Friday, Vision, RAIN and Biscuit
- Security analysis of ZKPoK based on MQ problem in the multi-instance setting
- Preliminary cryptanalysis of the Biscuit signature scheme
- An analysis of the Crossbred algorithm for the MQ 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)