MR-DSS -- smaller MinRank-based (ring-)signatures
From MaRDI portal
Publication:6166980
Recommendations
- Logarithmic-size ring signatures with tight security from the DDH assumption
- RingRainbow -- an efficient multivariate ring signature scheme
- On tightly-secure (linkable) ring signatures
- Sub-linear size traceable ring signatures without random oracles
- Distributed ring signatures from general dual access structures
- Ring Signatures of Sub-linear Size Without Random Oracles
- Leakage-resilient ring signature schemes
- Ranksign: an efficient signature algorithm based on the rank metric
- Topics in Cryptology – CT-RSA 2006
Cites work
- scientific article; zbMATH DE number 1583768 (Why is no real title available?)
- scientific article; zbMATH DE number 697807 (Why is no real title available?)
- scientific article; zbMATH DE number 2081078 (Why is no real title available?)
- scientific article; zbMATH DE number 2086722 (Why is no real title available?)
- scientific article; zbMATH DE number 1418284 (Why is no real title available?)
- A new identification scheme based on syndrome decoding
- A rank attack against extension field cancellation
- Advances in Cryptology - EUROCRYPT 2004
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Cryptanalysis of Rainbow
- Efficient key recovery for all HFE signature variants
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Full cryptanalysis of the Chen identification protocol
- Gaussian elimination is not optimal
- He gives C-sieves on the CSIDH
- Improved cryptanalysis of UOV and Rainbow
- Improved identification schemes based on error-correcting codes
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Key recovery attack for ZHFE
- Key recovery attack on the cubic ABC Simple Matrix Multivariate Encryption Scheme
- LESS is more: code-based signatures without syndromes
- LESS-FM: fine-tuning signatures from the code equivalence problem
- Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\)
- Raptor: a practical lattice-based (linkable) ring signature
- Ring signatures: Stronger definitions, and constructions without random oracles
- Secure ID-based linkable and revocable-iff-linked ring signature with constant-size construction
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- The computational complexity of some problems of linear algebra
- Zero-knowledge proofs from secure multiparty computation
Cited in
(5)- MinRank in the head. Short signatures from zero-knowledge proofs
- PKP-based signature scheme
- scientific article; zbMATH DE number 2081078 (Why is no real title available?)
- Revisiting algebraic attacks on MinRank and on the rank decoding problem
- Building MPCitH-based signatures from MQ, MinRank, and rank SD
This page was built for publication: MR-DSS -- smaller MinRank-based (ring-)signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166980)
