A correction to a code-based blind signature scheme
From MaRDI portal
Publication:2163765
Recommendations
- A Provably Secure Blind Signature Scheme
- Security of blind signatures revisited
- Security of blind signatures revisited
- A code-based undeniable signature scheme
- Boosting the Security of Blind Signature Schemes
- A code-based signature scheme from the Lyubashevsky framework
- scientific article; zbMATH DE number 1088232
- A blind signature scheme based on bilinear pairings
- An efficient attack on a code-based signature scheme
- On the security of digital signature schemes based on error-correcting codes
Cites work
- A code-based group signature scheme
- A Distinguisher for High-Rate McEliece Cryptosystems
- A new identification scheme based on syndrome decoding
- A new paradigm for public key identification
- Cryptography with Constant Input Locality
- Durandal: a rank metric based signature scheme
- Efficient Round Optimal Blind Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- scientific article; zbMATH DE number 2081064 (Why is no real title available?)
- Implementing CFS
- Lattice-based blind signatures
- Lattice-based blind signatures, revisited
- Parallel-CFS
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Security arguments for digital signatures and blind signatures
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
Cited in
(4)
This page was built for publication: A correction to a code-based blind signature scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2163765)