The Community for Technology Leaders
RSS Icon
Issue No.03 - July-September (2008 vol.5)
pp: 155-163
Jian Ren , Michigan State University, East Lansing
Ring signature was first introduced in 2001. In a ring signature, instead of revealing the actual identity of the message signer, it specifies a set of possible signers. The verifier can be convinced that the signature was indeed generated by one of the ring members, however, she is unable to tell which member actually produced the signature. In this paper, we propose a generalized ring signature scheme and a generalized multi-signer ring signature based on the original ElGamal signature scheme. The proposed ring signature can achieve unconditional signer ambiguity and is secure against adaptive chosen-message attacks in the random oracle model. Comparing to ring signature based on RSA algorithm, the proposed generalized ring signature scheme has three advantages: (1) all ring members can share the same prime number and all operations can be performed in the same domain; (2) by combining with multi-signatures, we can develop the generalized multi-signer ring signature schemes to enforce cross-organizational involvement in message leaking. It may result in a higher level of confidence or broader coverage on the message source; and (3) the proposed ring signature is a convertible ring signature. It enables the actual message signer to prove to a verifier that only she is capable of generating the ring signature.
Network-level security and protection, Security and Privacy Protection
Jian Ren, "Generalized Ring Signatures", IEEE Transactions on Dependable and Secure Computing, vol.5, no. 3, pp. 155-163, July-September 2008, doi:10.1109/TDSC.2008.22
[1] R.L. Rivest, A. Shamir, and Y. Tauman, “How to Leak a Secret,” Advances in Cryptology—ASIACRYPT, 2001.
[2] D. Chaum and E.v. Heyst, “Group Signatures,” Proc. Advances in Cryptology (EuroCrypt '91), D.W. Davies, ed., vol. 547, pp. 257-265, 1991.
[3] J.L. Camenisch, “Efficient and Generalized Group Signatures,” Proc. Advances in Cryptology (EuroCrypt '97), W. Fumy, ed., vol.1233, pp. 465-479, 1997.
[4] J.L. Camenisch and M.A. Stadler, “Efficient Group Signature Schemes for Large Groups,” Proc. Advances in Cryptology (Crypto '97), B. Kaliski, ed., vol. 1294, pp.410-424, 1997.
[5] J. Herranz and G. Saez, “Forking Lemmas in the Ring Signatures' Scenario,” Int'l Assoc. Cryptologic Research, Technical Report 067,, 2003.
[6] C.P. Schnorr, “Efficient Identification and Signatures for Smart Cards,” Proc. Advances in Cryptology (Crypto '89), G. Brassard, ed., vol.435, pp. 239-252, 1989.
[7] J. Xu, Z. Zhang, and D. Feng, “A Ring Signature Scheme Using Bilinear Pairings,” Lecture Notes in Computer Science, vol. 3325, 2005.
[8] A.K. Awasthi and S. Lal, A New Proxy Ring Signature Scheme, , 2004.
[9] C.-Y. Lin and T.-C. Wu, “An Identity-Based Ring Signature Scheme from Bilinear Pairings,” Proc. 18th Int'l Conf. Advanced Information Networking and Applications (AINA '04), pp. 182-185, 2004.
[10] W. Cheng, W. Lang, Z. Yang, G. Liu, and Y. Tan, “An Identity-Based Proxy Ring Signature Scheme from Bilinear Pairings,” Proc. Ninth Int'l Symp. Computers and Comm. (ISCC '04), vol. 1, pp. 424-429, June/July 2004.
[11] C. Gamage, B. Gras, B. Crispo, and A.S. Tanenbaum, “An Identity-Based Ring Signature Scheme with Enhanced Privacy,” Proc. Securecomm and Workshops, pp. 1-5, Aug./Sept. 2006.
[12] C. Hu and D. Li, “Forward-Secure Traceable Ring Signature,” Proc. Eighth ACIS Int'l Conf. Software Eng., Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD '07), pp.200-204, July/Aug. 2007.
[13] J. Li, T.H. Yuen, X. Chen, and Y. Wang, “Proxy Ring Signature: Formal Definitions, Efficient Construction and New Variant,” Proc. Int'l Conf. Computational Intelligence and Security (CIS '06), vol. 2, pp. 1259-1264, Nov. 2006.
[14] C. Hu and D. Li, “A New Type of Proxy Ring Signature Scheme with Revocable Anonymity,” Proc. Eighth ACIS Int'l Conf. Software Eng., Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD '07), vol. 1, pp. 866-868, July/Aug. 2007.
[15] C. Zhang, Y. Liu, and D. He, “A New Verifiable Ring Signature Scheme Based on Nyberg-Rueppel Scheme,” Proc. Eighth Int'l Conf. Signal Processing (ICSP), 2006.
[16] K.-C. Lee, H.-A. Wen, and T. Hwang, “Convertible Ring Signature,” IEE Proc.-Comm., vol. 152, no. 4, pp. 411-414,, Aug. 2005.
[17] S. Goldwasser, S. Micali, and R.L. Rivest, “A Digital Signature Scheme Secure against Adaptive Chosen-Message Attacks,” SIAM J. Computing, vol. 17, no. 2, pp. 281-308, Apr. 1988.
[18] E. Bresson, J. Stern, and M. Szydlo, “Threshold Ring Signatures and Applications to Ad-Hoc Groups,” Proc. Advances in Cryptology (CRYPTO '02), vol. 2442, pp. 465-480, 2002.
[19] H. Kuwakado and H. Tanaka, “Threshold Ring Signature Scheme Based on the Curve,” Proc. IEEE Int'l Symp. Information Theory (ISIT '03), vol. 2442, p. 139, 2003.
[20] Z.Y. Wu, F. Gwo, J. Tzer, and S. Chen, “A Novel Id-Based Threshold Ring Signature Scheme Competent for Anonymity and Anti-Forgery,” Proc. Int'l Conf. Computational Intelligence and Security (CIS '06), pp. 1351-1354, Nov. 2006.
[21] Y.-S. Chen, C.-L. Lei, Y.-P. Chiu, and C.-Y. Huang, “Confessible Threshold Ring Signatures,” Proc. Int'l Conf. Systems and Networks Comm. (ICSNC '06), p. 25, 2006.
[22] R. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Comm. ACM, vol. 21, no. 2, pp. 120-126, 1978.
[23] T.A. ElGamal, “A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” IEEE Trans. Information Theory, vol. 31, no. 4, pp. 469-472, 1985.
[24] L. Harn, “Group-Oriented $(t, n)$ Threshold Digital Signature Scheme and Digital Multisignature,” IEE Proc. Computers and Digital Techniques, vol. 141, no. 5, pp. 307-313, Sept. 1994.
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool