论文信息 - Key Substitution Attacks on the CFS Signature

Key Substitution Attacks on the CFS Signature

At Asiacrypt'2001, Courtois, Finiasz and Sendrier proposed the first coding-based signature scheme which is also known as the CFS signature. The CFS signature is seen as one of the candidates of quantum immune signatures. In this letter, we show that the CFS signature is susceptible to both strong-key substitution attacks and weak-key substitution attacks. We also discuss potential countermeasures.

Chun-Hua Chen | Hong Zhang | Bennian Dou

[1] Robert J. McEliece,et al. A public key cryptosystem based on algebraic coding theory , 1978 .

[2] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.

[3] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..

[4] Léonard Dallot. Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme , 2007, WEWoRC.

[5] Chik How Tan. Key Substitution Attacks on Provably Secure Short Signature Schemes , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[6] Alfred Menezes,et al. Unknown Key-Share Attacks on the Station-to-Station (STS) Protocol , 1999, Public Key Cryptography.

[7] Matthieu Finiasz,et al. How to Achieve a McEliece-Based Digital Signature Scheme , 2001, ASIACRYPT.

[8] Mihir Bellare,et al. Multi-signatures in the plain public-Key model and a general forking lemma , 2006, CCS '06.

[9] Alexandra Boldyreva,et al. Efficient threshold signature , multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme , 2002 .

[10] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[11] Chik How Tan,et al. Key Substitution Attacks on Some Provably Secure Signature Schemes , 2004, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..