Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme

DOI10.1007/978-3-540-88353-1_6zbMath1166.94308OpenAlexW1479860068MaRDI QIDQ5504550

Léonard Dallot

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

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

On the security of the Courtois-Finiasz-Sendrier signature ⋮ A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes ⋮ A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory ⋮ Identity based identification from algebraic coding theory ⋮ Quantum-assisted QD-CFS signatures ⋮ Parallel-CFS ⋮ Variant of Niederreiter-based signature scheme for blockchain technology ⋮ The security of the code-based signature scheme based on the Stern identification protocol

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme