Ring signature based on ElGamal signature

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

Volumn 4138 LNCS, Issue , 2006, Pages 445-456

  Ren, Jian ^a   Harn, Lein ^b  

^a MICHIGAN STATE UNIVERSITY   (United States)

^b UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ELECTRONIC MAIL; SECURITY OF DATA; SOCIETIES AND INSTITUTIONS;

AUTHENTICATION; MULTISIGNER RING SIGNATURE; RSA ALGORITHMS;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33749668881     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814856_43     Document Type: Conference Paper

References (13)

1. R. L. Rivest, A. Shamir, and Y. Tauman. How to leak a secret. In Advances in Cryptology-ASIACRYPT'01, Lect. Notes Comput. Sci., 2248, pages 552-565, 2001.
2. D. Chaum and E. van Heyst. Group signatures. In Donald W. Davies, editor, Advances in Cryptology - EuroCrypt '91, pages 257-265, Berlin, 1991. SpringerVerlag. Lecture Notes in Computer Science Volume 547.
3. J. Herranz and G. Saez. Forking lemmas in the ring signatures' scenario. Technical Report 067, International Association for Cryptologic Research, http://eprint.iacr.org/2003/067.ps, 2003.
4. C. P. Schnorr. Efficient identification and signatures for smart cards. In Gilles Brassard, editor, Advances in Cryptology - Crypto'89, pages 239-252, Berlin, 1989. Springer-Verlag. Lecture Notes in Computer Science Volume 435.
5. M. Abe, M. Ohkubo, and K. Suzuki. 1-out-of-n signatures from a variety of keys. In ASIACRYPT, Lect. Notes Comput. Sci., 2501, pages 415-432, 2002.
6. S. J. Kim, S. J. Park, and D. H. Won. Convertible group signature. In Proc. Advances in Cryptology-ASIACRYPT'96, Lect. Notes Comput. Sci., 1163, pages 311-321, 1996.
7. K.-C. Lee, H.-A. Wen, and T. Hwang. Convertible ring signature. IEE Proceedings - Communications, 152(4):411-414, August 2005.
8. J. Boyar, D. Chaum, and I. Damgard. Convertible undeniable signatures. In Proc. Advances in Cryptology-CRYPTO'90, Lect. Notes Comput. Sci., 537, pages 189-205, 1991.
9. E. Bangerter, J. Camenisch, and U. Maurer. Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order. In PKC 2005, 2005.
10. E. Bresson, J. Stern, and M. Szydlo. Threshold ring signatures and applications to ad-hoc groups. In Proc. Advances in Cryptology-CRYPTO'02, Lect. Notes Comput. Sci., 2442, pages 465-480, 2002.
11. T. A. ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469-472, 1985.
12. S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput., 17(2):281-308, April 1988.
13. L. Harn. Group-oriented (t,n) threshold digital signature scheme and digital multisignature. IEE Proc.-Comput. Digit. Tech., 141(5):307-313, September 1994.