Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
From MaRDI portal
Publication:5504550
DOI10.1007/978-3-540-88353-1_6zbMath1166.94308MaRDI QIDQ5504550
Publication date: 22 January 2009
Published in: Research in Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-88353-1_6
Related Items
A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes, The security of the code-based signature scheme based on the Stern identification protocol, Identity based identification from algebraic coding theory, Quantum-assisted QD-CFS signatures, On the security of the Courtois-Finiasz-Sendrier signature, Variant of Niederreiter-based signature scheme for blockchain technology, Parallel-CFS, A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
Cites Work
- Probabilistic encryption
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Undeniable Signatures
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- On the inherent intractability of certain coding problems (Corresp.)
- On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item