Cryptanalysis of a code-based one-time signature
From MaRDI portal
Publication:2200516
Recommendations
- Asymptotically efficient lattice-based digital signatures
- Asymptotically Efficient Lattice-Based Digital Signatures
- Lattice signatures without trapdoors
- Lattice signatures and bimodal Gaussians
- Lattice-based signcryption without random oracles
- Public Key Cryptography - PKC 2005
- Analysis of error terms of signatures based on learning with errors
- Transcript secure signatures based on modular lattices
- Publication:3202944
Cites work
- scientific article; zbMATH DE number 1722680 (Why is no real title available?)
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- Efficient Encryption From Random Quasi-Cyclic Codes
- Lattice signatures without trapdoors
- On the inherent intractability of certain coding problems (Corresp.)
- Ouroboros: a simple, secure and efficient key exchange protocol based on coding theory
- Security arguments for digital signatures and blind signatures
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(9)- Ternary forking lemma and its application to the analysis of one code-based signature
- A code-based signature scheme from the Lyubashevsky framework
- \textsf{FuLeeca}: a Lee-based signature scheme
- scientific article; zbMATH DE number 7141562 (Why is no real title available?)
- Cryptanalysis of a rank-based signature with short public keys
- Cryptanalysis of a code-based full-time signature
- An efficient attack on a code-based signature scheme
- SPANSE: combining sparsity with density for efficient one-time code-based digital signatures
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
This page was built for publication: Cryptanalysis of a code-based one-time signature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200516)