Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

The digital signature technique is a popular research branch in the field of contemporary cryptography because of its popularity in both economic and official applications. As more and more information gets processed digitally, digital signatures come to play a more and more important role. The prevention of the signature repudiation is therefore a basic requirement for digital signature techniques living up to. However, in some signature schemes, the validity of the signature is confirmed through some extra parameters or by certain trusted third parties. In 1999, Araki et al. proposed a scheme known for being convertible. In their scheme, certain verifiers can examine the signature without the help of the signers. Since then, many researchers have been devoted to the research and development of schemes with such a property. In this paper, we shall propose a new convertible group signature scheme. Our new scheme is based on two assumptions: the complexity of the discrete logarithm problem and the un-reversibility of the one-way hash function. In our discussion section later, we shall consider some possible attacks and prove that our new scheme is able to survive them. In addition, the special strength of our scheme is its efficient verification mechanism.

REFERENCES

• 1: Yvo Desmedt , Yair Frankel, Shared Generation of Authenticators and Signatures (Extended Abstract), Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, p.457-469, August 11-15, 1991
• 2: L. Harn, "Group-oriented (t,n) threshold digital signature scheme and digital multisignature", IEE Proceedings of Computers and Digital Techniques, pp. 307--313, 1994.
• 3: C. Li, T. Hwang, and N. Lee, "Threshold-multisignature schemes where suspected forgery implies traceability of adversarial shareholders", Proceedings of Advances in Cryptology - EuroCrypto '94, Perugia, Italy, pp. 194--204, 1994.
• 4: Lein Harn , Shoubao Yang, Group-Oriented Undeniable Signature Schemes without the Assistance of a Mutually Trusted Party, Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology, p.133-142, December 13-16, 1992
• 5: S. Kremer, O. Markowitch, and J. Zhou, "An intensive survey of fair non-repudiation protocols", Computer Communications, vol. 25, pp. 1606--1621, 2002.
• 6: J. Zhou and K. Y. Lam, "Securing digital signatures for non-repudiation", Computer Communications, vol. 22, pp. 710--716, 1999.
• 7: H. F. Huang and C. C. Chang, "An efficient convertible authenticated encryption scheme and its variant", Lecture Notes in Computer Science- Information and Communications Security (ICICS 2003). (S. Qing, D. Gollmann, J. Zhou Eds.), Springer Verlag, Germany, pp. 382--392, 2003.
• 8: S. Araki, S. Uehara, and Imamura K., "The limited verifier signature and its application", IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E82-A, pp. 63--68, 1999.
• 9: Tzong-Sun Wu , Chien-Lung Hsu, Convertible authenticated encryption scheme, Journal of Systems and Software, v.62 n.3, p.205-209, 15 June 2002 [doi>10.1016/S0164-1212(01)00143-1]

INDEX TERMS

Keywords:
convertible, discrete logarithm problem, group signature, one way hash function