A new efficient threshold ring signature scheme based on coding theory

IEEE Transactions on Information Theory

Volumn 57, Issue 7, 2011, Pages 4833-4842

  Aguilar Melchor, Carlos ^a   Cayrel, Pierre Louis ^b   Gaborit, Philippe ^a   Laguillaumie, Fabien ^c  

^a UNIVERSITY OF LIMOGES   (France)

^b Center for Advanced Security Research   (Germany)

^c UNIVERSITÉ DE CAEN   (France)

Author keywords

Code based cryptography; Stern's authentication scheme; syndrome decoding; threshold ring signature

Indexed keywords

CHOSEN MESSAGE ATTACKS; CODE-BASED CRYPTOGRAPHY; CODING THEORY; EXTENDED VERSIONS; MINIMUM DISTANCE; PUBLIC KEYS; RANDOM ORACLE MODEL; RING SIGNATURE SCHEMES; RING SIGNATURES; STERN'S AUTHENTICATION SCHEME; SYNDROME DECODING; THRESHOLD RING SIGNATURES;

CODES (SYMBOLS); COMPUTER PROGRAMMING; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

AUTHENTICATION;

EID: 79959571025     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2145950     Document Type: Article

References (46)

1. M. Abe, M. Ohkubo, and K. Suzuki, "1-out-of-N signatures from a variety of keys," in Proc. Asiacrypt 2002, 2002, vol. 2501, Lecture Notes in Computer Science, pp. 415-432.
2. C. Aguilar Melchor, P. Cayrel, and P. Gaborit, "A new efficient threshold ring signature scheme based on coding theory," in Proc. PQCrypto 2008, 2008, pp. 1-16.
3. A. Bender, J. Katz, and R. Morselli, "Ring signatures: Stronger definitions, and constructions without random oracles," in Proc. TCC 2006, 2006, vol. 3876, Lecture Notes in Computer Science, pp. 60-79. (Pubitemid 43979844)
4. T. Berger, P.-L. Cayrel, P. Gaborit, and A. Otmani, "Reducing key length of the McEliece cryptosystem," in Proc. AFRICACRYPT 2009, LNCS, 2009, pp. 77-97.
5. E. Berlekamp, R. McEliece, and H. van Tilborg, "On the inherent intractability of certain coding problems," IEEE Trans. Inf. Theory, vol. IT-24, no. 3, pp. 384-386, 1978. (Pubitemid 8607605)
6. D. Bernstein, T. Lange, and C. Peters, "Attacking and defending the McEliece cryptosystem," in Proc. PQCrypto 2008,LNCS, 2008, pp. 31-46.
7. B. Biswas and N. Sendrier, "McEliece cryptosystem implementation: Theory and practice," in Proc. PQCrypto, 2008, pp. 47-62.
8. X. Boyen, "Mesh signatures," in Proc. Eurocrypt 2007, 2007, vol. 4515, Lecture Notes in Computer Science, pp. 210-227.
9. E. Bresson, J. Stern, and M. Szydlo, "Threshold ring signatures and applications to ad-hoc groups," in Proc. Crypto 2002, 2002, vol. 2442, Lecture Notes in Computer Science, pp. 465-480.
10. A. Canteaut and F. Chabaud, "A new algorithm for finding minimum- weight words in a linear code: Application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511," IEEE Trans. Inf. Theory, vol. IT-44, no. 1, pp. 367-378, 1988.
11. P.-L. Cayrel, P. Gaborit, and E. Prouff, "Secure implementation of the stern authentication and signature schemes for low-resource devices," in Proc. CARDIS, 2008, pp. 191-205.
12. N. Chandran, J. Groth, and A. Sahai, "Ring signatures of sub-linear size without random oracles," in Proc. ICALP 2007, 2007, vol. 4596, Lecture Notes in Computer Science, pp. 423-434.
13. D. Chaum and E. van Heyst, "Group signatures," in Proc. Eurocrypt 1991, 1991, vol. 546, Lecture Notes in Computer Science, pp. 257-265.
14. N. Courtois, M. Finiasz, and N. Sendrier, "How to achieve a McEliece based digital signature scheme," in Proc. Asiacrypt 2001, 2001, vol. 2248, Lecture Notes in Computer Science, pp. 157-174.
15. L. Dallot and D. Vergnaud, "Provably secure code-based threshold ring signature," in Proc. IMA Conf. Cryptogr. Coding, 2009, to appear in Springer Lecture Notes in Computer Science.
16. Y. Dodis, A. Kiayias, A. Nicolosi, and V. Shoup, "Anonymous identification in ad-hoc groups," in Proc. Eurocrypt 2004, 2004, vol. 3027, Lecture Notes in Computer Science, pp. 609-626.
17. T. Eisenbarth, T. Güneysu, S. Heyse, and C. Paar, "MicroEliece: McEliece for embedded devices," in Proc. CHES, 2009, pp. 49-64.
18. J.-C. Faugere, A. Otmani, L. Perret, and J.-P. Tillich, "Algebraic cryptanalysis of McEliece variants with compact keys," in Proc. EUROCRYPT, 2010, pp. 279-298.
19. A. Fiat and A. Shamir, "How to prove yourself: Practical solutions to identification and signature problems," in Proc. Crypto 1986, 1986, vol. 263, pp. 186-194, Springer LNCS.
20. M. Finiasz and N. Sendrier, "Security bounds for the design of codebased cryptosystems," in Proc. ASIACRYPT, 2009, pp. 88-105.
21. P. Gaborit, "Shorter keys for code based cryptography," in Proc. WCC'05, Mar. 2005, pp. 81-95.
22. P. Gaborit and M. Girault, "Lightweight code-based authentication and signature," in Proc. Int. Symp. Inf. Theory ISIT, 2007, pp. 200-203.
23. S. Goldwasser, S.Micali, and R. L. Rivest, "A digital signature scheme secure against adaptive chosen-message attacks," SIAM J. Comput., vol. 17, no. 2, pp. 281-308, 1988.
24. J. Herranz and G. Saez, "Forking lemmas for ring signature schemes," in Proc. Indocrypt 2003, 2003, vol. 2904, Lecture Notes in Computer Science, pp. 266-279.
25. S. Heyse, A. Moradi, and C. Paar, "Practical power analysis attacks on software implementations of McEliece," in Proc. PQCrypto, 2010, pp. 108-125.
26. M. Jakobsson, K. Sako, and R. Impagliazzo, "Designated verifier proofs and their applications," in Proc. Eurocrypt 1996, 1996, vol. 1070, Lecture Notes in Computer Science, pp. 142-154.
27. H. Kuwakado and H. Tanaka, "Threshold ring signature scheme based on the curve," Trans. Inf. Processing Soc. Japan, vol. 44, no. 8, pp. 2146-2154, 2003.
28. J. K. Liu, V. K. Wei, and D. S. Wong, "A separable threshold ring signature scheme," in Proc. ICISC 2003, 2003, vol. 2971, Lecture Notes in Computer Science, pp. 352-369.
29. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
30. R. Misoczki and P. S. L. Barreto, "Compact McEliece keys from goppa codes," in Proc. SAC'09, LNCS, 2009, vol. 5580.
31. M. Naor, "Deniable ring identification," in Proc. Crypto 2002, 2002, vol. 2442, Lecture Notes in Computer Science, pp. 481-498.
32. J. N. Pierce, "Limit distributions of the minimum distance of random linear codes," IEEE Trans. Inf. Theory, vol. IT-13, pp. 595-599, 1967.
33. P. Pointcheval and J. Stern, "Security proofs for signature schemes," in Proc. Eurocrypt 1996, 1996, vol. 1070, Lecture Notes in Computer Science, pp. 387-398. (Pubitemid 126071081)
34. R. L. Rivest, A. Shamir, and Y. Tauman, "Howto leak a secret," in Proc. Asiacrypt 2001, 2001, vol. 2248, Lecture Notes in Computer Science, pp. 552-565.
35. N. Sendrier, Cryptosystèmes à clé publique basés sur les codes correcteurs d'erreurs Mémoire d'habilitation, Inria 2002, available at: [Online]. Available: http://www-rocq.inria.fr/codes/ Nicolas.Sendrier/pub.html
36. H. Shacham and B. Waters, "Efficient ring signatures without random oracles," in Proc. PKC 2007, 2007, vol. 4450, Lecture Notes in Computer Science, pp. 166-180.
37. A. Shamir, "How to share a secret," Commun. ACM, vol. 22, no. 11, pp. 612-613, 1979.
38. J. Stern, "A new identification scheme based on syndrome decoding," in Proc. Crypto 1993, 1994, vol. 773, Lecture Notes in Computer Science, pp. 13-21.
39. J. Stern, "A new paradigm for public key identification," IEEE Trans. Inf. Theory, vol. IT 42, no. 6, pp. 2757-2768, 1996.
40. P. P. Tsang, V. K. Wei, T. K. Chan, M. H. Au, J. K. Liu, and D. S. Wong, "Separable linkable threshold ring signatures," in Proc. Indocrypt 2004, 2004, vol. 3348, Lecture Notes in Computer Science, pp. 384-398. (Pubitemid 39748322)
41. A. Vardy, "The intractability of computing the minimum distance of a code," IEEE Trans. Inf. Theory, vol. IT 43, no. 6, pp. 1757-1766, 1997. (Pubitemid 127826468)
42. P. Véron, "A fast identification scheme," in Proc. IEEE Int. Symp. Inf. Theory'95, 1995.
43. D. S. Wong, K. Fung, J. K. Liu, and V. K. Wei, "On the RSCode construction of ring signature schemes and a threshold setting of RST," in Proc. ICICS 2003, 2003, vol. 2836, Lecture Notes in Computer Science, pp. 34-46.
44. J. Xu, Z. Zhang, and D. Feng, "A ring signature scheme using bilinear pairings," in Proc. WISA 2004, 2005, vol. 3325, Lecture Notes in Computer Science, pp. 160-169. (Pubitemid 41190810)
45. F. Zhang and K. Kim, "ID-based blind signature and ring signature from pairings," in Proc. Asiacrypt 2002, 2002, vol. 2501, Lecture Notes in Computer Science, pp. 533-547.
46. D. Zheng, X. Li, and K. Chen, "Code-based ring signature scheme," Int. J. Network Secur., vol. 5, no. 2, pp. 154-157, 2007.