MR-DSS -- smaller MinRank-based (ring-)signatures
From MaRDI portal
Publication:6166980
DOI10.1007/978-3-031-17234-2_8zbMath1517.94180OpenAlexW4297042453MaRDI QIDQ6166980
Carlo Sanna, Javier A. Verbel, Andre Esser, Emanuele Bellini
Publication date: 7 July 2023
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-17234-2_8
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (2)
Revisiting algebraic attacks on MinRank and on the rank decoding problem ⋮ MinRank in the head. Short signatures from zero-knowledge proofs
Cites Work
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
- Ring signatures: Stronger definitions, and constructions without random oracles
- The computational complexity of some problems of linear algebra
- Improved identification schemes based on error-correcting codes
- Key recovery attack for ZHFE
- Key recovery attack on the cubic ABC Simple Matrix Multivariate Encryption Scheme
- Secure ID-based linkable and revocable-iff-linked ring signature with constant-size construction
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Improved cryptanalysis of UOV and Rainbow
- LESS-FM: fine-tuning signatures from the code equivalence problem
- He gives C-sieves on the CSIDH
- Efficient key recovery for all HFE signature variants
- Raptor: a practical lattice-based (linkable) ring signature
- Gaussian elimination is not optimal
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- Full Cryptanalysis of the Chen Identification Protocol
- Cryptanalysis of Rainbow
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- A new identification scheme based on syndrome decoding
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
- A Rank Attack Against Extension Field Cancellation
- LESS is More: Code-Based Signatures Without Syndromes
- Advances in Cryptology - EUROCRYPT 2004
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: MR-DSS -- smaller MinRank-based (ring-)signatures
