Chin-Chen Chang
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.
- Y. Desmedt and Y. Frankel, "Shared generation of authentications and signatures", Proceedings of Advances in Cryptography - Crypto '91, Brighton, UK, pp. 457--469, 1991. Google Scholar
Digital Library
- L. Harn, "Group-oriented (t,n) threshold digital signature scheme and digital multisignature", IEE Proceedings of Computers and Digital Techniques, pp. 307--313, 1994.Google Scholar
- 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.Google Scholar
- L. Harn and S. Yang, "Group-oriented undeniable signature schemes without the assistance of mutually trusted party", Proceedings of Advances in Cryptography - Auscrypt '92, Gold Coast, Queensland, pp. 133--142, 1992. Google ScholarDigital Library
- S. Kremer, O. Markowitch, and J. Zhou, "An intensive survey of fair non-repudiation protocols", Computer Communications, vol. 25, pp. 1606--1621, 2002. Google ScholarDigital Library
- J. Zhou and K. Y. Lam, "Securing digital signatures for non-repudiation", Computer Communications, vol. 22, pp. 710--716, 1999. Google ScholarDigital Library
- 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.Google Scholar
- 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.Google Scholar
- T Wu and C. Hsu, "Convertible authenticated encryption scheme", The Journal of Systems and Software, vol. 62, pp. 205--209, 2002. Google ScholarDigital Library
Index Terms
- A convertible group signature scheme
Recommendations
Provably Secure Convertible Nominative Signature Scheme
Information Security and CryptologyNominative signature, introduced by Kim, Park and Won, is a useful cryptographic primitive to limit the publicly verifiable property of ordinary digital signature. In a nominative signature scheme, a nominator and a nominee jointly generate a signature ...
Provably secure pairing-based convertible undeniable signature with short signature length
Pairing'07: Proceedings of the First international conference on Pairing-Based CryptographyUndeniable signatures, introduced by Chaum and van Antwerpen, is a useful cryptography primitive to limit the publicly verifiable property of ordinary digital signatures. In an undeniable signature scheme, the validity or invalidity of the signature can ...
Improved convertible authenticated encryption scheme with provable security
Convertible authenticated encryption (CAE) schemes allow a signer to produce an authenticated ciphertext such that only a designated recipient can decrypt it and verify the recovered signature. The conversion property further enables the designated ...
Comments