Biscuit: new MPCitH signature scheme from structured multivariate polynomials
From MaRDI portal
Publication:6547993
DOI10.1007/978-3-031-54770-6_18MaRDI QIDQ6547993FDOQ6547993
Authors: Luk Bettale, Delaram Kahrobaei, Ludovic Perret, Javier A. Verbel 
Publication date: 31 May 2024
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
- 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
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)
