Convertible group signatures
Group signatures, introduced by Chaum and van Heyst at Eurocrypt'91, allow individual members of a group to sign messages on behalf of the group while remaining anonymous. Furthermore, in case of disputes later a trusted authority, who is given some auxiliary information, can identify the signer. In this paper, we introduce a new kind of group signature scheme, called “convertible group signatures”. In these schemes, in addition to the properties of group signatures, release of a single bit string by the signer turns all of his group signatures into ordinary digital signatures. Then, we present a non-interactive selectively convertible group signature scheme.
Unable to display preview. Download preview PDF.
- 1.J. Boyar, D. Chaum, I. Damgard and T. Pedersen, “Convertible undeniable signature”, Proc. Crypto'90, pp. 195–208.Google Scholar
- 3.D. Chaum and E. van Heyst, “Group Signatures”, Eurocrypt'91, pp. 257–265, 1991.Google Scholar
- 4.L. Chen and T. P. Pedersen, “New Group Signature Schemes”, Proc. of Eurocrypt'94, pp. 163–173.Google Scholar
- 5.W. Diffie and M. Hellman, “New Directions in Cryptography”, IEEE Transactions on Information Theory IT-22, pp. 644–654, 1976.Google Scholar
- 6.S. J. Park, I. S. Lee, and D. H. Won, “A Practical Group Signature”, Proc. of JW-ISC'95, Japan, pp. 127–133, 1995. 1.Google Scholar
- 7.S. J. Park and D. H. Won, “A Practical Identity-based Group Signature”, Proc. of ICEIC'95, China, pp. II-64II–67, 1995. 8.Google Scholar
- 8.S. J. Park and D. H. Won, “A Generalization of Public Key Residue Cryptosystem”, Proc. of JW-ISC93, Korea, pp. 202–206, 1993.Google Scholar
- 9.S. J. Park and D. H. Won, “A Generalized Public Key Residue Cryptosystem and Its Applications”, IEEE GLOBECOM'95, Singapore, pp. 1179–1182, 1995. 11.Google Scholar
- 10.S. J. Park, Chung Ryong Jang, Kyung Sin Kim and D. H. Won, “A ”Paradoxical” Identity-based Scheme Based on the γ th-Residuosity Problem and Discrete Logarithm Problem”, An International Conference on Numbers and Forms, Cryptography and Codes, Khabarovsk, Russia, 1994. 8.Google Scholar
- 11.Sangjoon Park, private communication.Google Scholar
- 13.Y. Zheng, “A Study on Probabilistic Cryptosystems and Zero-knowledge Protocol”, Master thesis, Yokohama National University, 1988.Google Scholar
- 14.Y. Zheng, T. Matsumoto, and H. Imai, “Residuosity Problem and its Applications to Cryptography”, Trans. IEICE, vol. E71, No. 8, pp. 759–767, 1988.Google Scholar