A code-based signature scheme from the Lyubashevsky framework
From MaRDI portal
Publication:2192378
DOI10.1016/j.tcs.2020.05.011zbMath1457.94222OpenAlexW3032150586MaRDI QIDQ2192378
Yongcheng Song, Huaxiong Wang, Wei Wu, Yi Mu, Xin-Yi Huang
Publication date: 17 August 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.05.011
Linear codes (general theory) (94B05) Authentication, digital signatures and secret sharing (94A62) Circuits in qualitative investigation and simulation of models (94C60)
Related Items (4)
A new key recovery attack on a code-based signature from the Lyubashevsky framework ⋮ A code-based hybrid signcryption scheme ⋮ Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge ⋮ Cryptanalysis of a code-based full-time signature
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- Identity-based encryption from codes with rank metric
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Durandal: a rank metric based signature scheme
- A Provably Secure Group Signature Scheme from Code-Based Assumptions
- An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Lattice Signatures without Trapdoors
- RankSign: An Efficient Signature Algorithm Based on the Rank Metric
- A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Improving code rate of McEliece's public-key cryptosystem
- Cryptography with Constant Input Locality
- Security Bounds for the Design of Code-Based Cryptosystems
- On the inherent intractability of certain coding problems (Corresp.)
- On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
- A new identification scheme based on syndrome decoding
- Efficient generation of binary words of given weight
- Run-length encodings (Corresp.)
- Limit distribution of the minimum distance of random linear codes
This page was built for publication: A code-based signature scheme from the Lyubashevsky framework
