Towards a concrete security proof of courtois, Finiasz and sendrier signature scheme

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4945 LNCS, Issue , 2008, Pages 65-77

  Dallot, Léonard ^a  

^a Centre National de la Recherche Scientifique   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CODING THEORY; GOPPA CODES; RANDOM ORACLE MODEL; SECURITY ANALYSIS; SECURITY PROOFS; SIGNATURE SCHEME;

COMPUTER PROGRAMMING; INFORMATION THEORY;

CRYPTOGRAPHY;

EID: 70349873550     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88353-1_6     Document Type: Conference Paper

References (19)

1. Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing effcient protocols. In: ACM Conference on Computer and Communications Security, pp. 62-73 (1993)
2. Bellare, M., Rogaway, P.: The exact security of digital signatures - how to sign with rsa and rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.1070. pp. 399-416. Springer, Heidelberg (1996)
3. Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Trans. Inform. Th. 24 (1978)
4. Chaum, D.: Blind signatures for untraceable payments. In: Advances in Cryptology - CRYPTO 1982, Lecture Notes Computer Science, p. 153. Springer, Heidelberg (1982)
5. Chaum, D., van Anderpen, H.: Undeniable signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.435, pp. 212-216. Springer, Heidelberg (1990)
6. Coron, J.S.: On the exact security of full domain hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.1880, pp. 229-236. Springer, Heidelberg (2000)
7. Courtois, N., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.2248, pp. 157-174. Springer, Heidelberg (2001)
8. Di.e, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inform. Th. 22(6), 644-654 (1976)
9. Finiasz, M.: Nouvelles constructions utilisant des codes correcteurs d'erreurs en cryptographie ̀a clef publique. PhD thesis, INRIA - Ecole Polytechnique (October 2004) (in French)
10. Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and Systems Sciences 28(2), 270-299 (1984)
11. Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing 17(2), 281-308 (1988)
12. Li, Y.X., Deng, R.H., Wang, X.M.: On the equivalence of McEliece's and Niederreiter's public-key cryptosystems. IEEE Trans. Inform. Th. 40(1), 271-273 (1994)
13. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North- Holland mathematical library, Amsterdam (1977)
14. McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Technical report, DSN Progress report # 42-44, Jet Propulsion Laboratory, Pasadena, Californila (1978)
15. Menezes, A.J., Vanstone, S.A., van Oorschot, P.C.: Handbook of Applied Cryptography. CRC Press, Inc., Boca Raton (1996)
16. Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory 15(2), 159-166 (1986)
17. Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. CACM 21 (1978)
18. Sendrier, N.: Cryptosyst̀emes ̀a cĺe publique baśes sur les codes correcteurs d'erreurs. Habilitation ̀a diriger les recherches, Universit́e Pierre et Marie Curie, Paris 6, Paris, France ( March 2002) (in French)
19. Shoup, V.: Sequences of games: a tool for taming complexity in security proofs (manuscript, November 2004) (revised, May 2005; January 2006)