Novel ID-based group signature

Information sciences

Volumn 120, Issue 1, 1999, Pages 131-141

  Tseng, Yuh Min ^a   Jan, Jinn Ke ^a  

^a NATIONAL CHUNG HSING UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; PROBLEM SOLVING; SECURITY OF DATA;

IDENTIFICATION-BASED GROUP SIGNATURES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 0033337817     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(99)00086-9     Document Type: Article

References (18)

1. D. Chaum, E. Heyst, Group signatures, in: Proc. EUROCRYPT'91, 1992, pp. 257-265.
2. L. Chen,T.P. Pedersen, New group signature schemes, in: Proc. EUROCRYPT'94, 1995, pp. 163-173.
3. Diffie W., Hellman M.E. New directions in cryptography. IEEE Trans. Inform. Theory. 22(6):1976;644-654.
4. ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory. 31(4):1985;469-472.
5. ISO/IEC 9798-3, Information technology - Security technique - Entity authentication mechanism - Part 3: Entity authentication using a public key algorithm, ISO, 1993.
6. Lee W.B., Chang C.C. Efficient group signature scheme based on the discrete logarithm. IEE Proc. Comput. Digit. Tech. 145(1):1998;15-18.
7. C.H. Lim, P.J. Lee, Modified Maurer-Yacobi's scheme and its application, in: Proc. AUSCRYPT'92, 1992, pp. 308-323.
8. U.M. Maurer, Y. Yacobi, Non-interactive public-key cryptography, in: Proc. EUROCRYPT'91, 1992, pp. 498-507.
9. Maurer U.M., Yacobi Y. A non-interactive public-key distribution system. Designs, Codes and Cryptography. 9:1996;305-316.
10. Maurer U.M. Fast generation of prime numbers and secure public-key distribution system. J. Cryptol. 8(3):1995;123-155.
11. Merkle R.C. A fast software one-way hash function. J. Cryptol. 1:1990;43-58.
12. Ohta K., Okamoto E. Practical extension of Fiat-Shamir scheme. Electr. Lett. 24(15):1988;955-956.
13. Park S., Kim S., Won D. ID-based group signature. Electr. Lett. 33(19):1997;1616-1617.
14. Pohlig S.C., Hellman M.E. An improved algorithm for computing logarithms over. GF(p) and its cryptographic significance IEEE Trans. Inform. Theory. 24:1978;106-110.
15. Pollard J.M. Theorems on factorization and primality testing. Proc. Cambridge Philos. Soc. 76:1974;521-528.
16. Rivest R.L., Shamir A., Adelman L. A method for obtaining digital signature and public key cryptosystem. Comm ACM. 21(2):1978;120-126.
17. A. Shamir, Identity-based cryptosystem based on the discrete logarithm problem, in: Proc. CRYPTO'84, 1985, pp. 47-53.
18. M. Stadler, Publicly verifiable secret sharing, in: Proc. EUROCRYPT'96, 1997, pp. 190-199.