LESS is More: Code-Based Signatures Without Syndromes
From MaRDI portal
Publication:5048961
DOI10.1007/978-3-030-51938-4_3zbMath1504.94204OpenAlexW3038403579MaRDI QIDQ5048961
Giacomo Micheli, Jean-François Biasse, Edoardo Persichetti, Paolo Maria Santíni
Publication date: 9 November 2022
Published in: Progress in Cryptology - AFRICACRYPT 2020 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-51938-4_3
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (12)
On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography ⋮ Syndrome decoding in the head: shorter signatures from zero-knowledge proofs ⋮ On the computational hardness of the code equivalence problem in cryptography ⋮ Hardness estimates of the code equivalence problem in the rank metric ⋮ An attack on a non-interactive key exchange from code equivalence ⋮ Take your MEDS: digital signatures from matrix code equivalence ⋮ Graph-theoretic algorithms for the alternating trilinear form equivalence problem ⋮ MR-DSS -- smaller MinRank-based (ring-)signatures ⋮ A code-based hybrid signcryption scheme ⋮ Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature ⋮ Cryptanalysis of a code-based full-time signature ⋮ LESS-FM: fine-tuning signatures from the code equivalence problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient signature generation by smart cards
- Improved identification schemes based on error-correcting codes
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Durandal: a rank metric based signature scheme
- SeaSign: compact isogeny signatures from class group actions
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Lattice Signatures without Trapdoors
- SPHINCS: Practical Stateless Hash-Based Signatures
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
- Grover vs. McEliece
- Digital Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Time/Space Trade-Offs for Reversible Computation
- Computing automorphism groups of error-correcting codes
- On the Dimension of the Hull
- A new identification scheme based on syndrome decoding
- Is code equivalence easy to decide?
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography
- McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks
- Identification protocols and signature schemes based on supersingular isogeny problems
This page was built for publication: LESS is More: Code-Based Signatures Without Syndromes
