Cryptanalysis of Xia-You group signature scheme

Journal of Systems and Software

Volumn 75, Issue 1-2, 2005, Pages 89-94

  Shao, Zuhua ^a  

^a ZHEJIANG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; FUNCTIONS; INTEGER PROGRAMMING; KNOWLEDGE ACQUISITION; PROBLEM SOLVING; SECURITY OF DATA;

E-BIDDING; E-VOTING; GROUP SIGNATURE; SIGNATURE SCHEME;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 9644268221     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jss.2003.11.019     Document Type: Article

References (14)

1. Ateniese, G., Camenisch, J., Joye, M., Tsudik, G., 2000. A practical and provably secure coalition-resistant group signature scheme. In: Advances in Cryptology - CRYPTO 2000 LNCS 1880. Springer, Berlin, pp. 255-270.
2. Camenisch, J., 1997. Efficient and generalized group signatures. In: Advances in Cryptology - EUROCRYPTO'97 LNCS 1233. Springer, Berlin, pp. 465-479.
3. Camenisch, J., Stadler, M., 1997. Efficient group signature schemes for large groups. In: Advances in Cryptology - CRYPTO'97 LNCS 1296. Springer, Berlin, pp. 410-424.
4. Chan, A., Frankel, Y., Tsiounis, Y., 1998. Easy come - easy go divisible cash. In: Advances in Cryptology - EUROCRYPTO'98 LNCS 1403. Springer, Berlin, pp. 561-575.
5. Chaum, D., Heyst, E., 1991. Group signature. In: Pre-proceeding of Eurocrypt'91, Brighton, Uk, 8-11. pp. 257-265.
6. Chen, L., Pedersen, T.P., 1995. New group signature schemes. In: Advances in Cryptology - EUROCRYPTO'94 LNCS 950. Springer, Berlin, pp. 171-181.
7. Joye, M., Kim, S., Lee, N.-Y., 1999. Cryptanalysis of two group signature schemes. In: Proceedings of Information Security Workshop'99 LNCS 1729. Springer, Berlin, pp. 271-275.
8. Lee, W.B., Chang, C.C., 1998. Efficient group signature scheme based on the discrete logarithm. IEE Proc. Comput. Digit. Tech. 145, 15-18.
9. Pedersen, H., 1997. How to convert any digital signature scheme into a group signature scheme. In: Security Protocols Workshop LNCS 1361. Springer, Berlin, pp. 177-190.
10. Pohlig, S.C., Hellman, M.E., 1998. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inform. Theory 24, 106-110.
11. Pollard, J.M., 1974. Theorems on factorization and primality testing. Proc. Camb. Philos. Soc. 76, 521-528.
12. Shamir, A., 1984. Identity-based cryptosystem based on the discrete logarithm problem. In: Advances in Cryptology - CRYPTO'84 LNCS 196. Springer, Berlin, pp. 47-53.
13. Simmons, G.J., Norris, J.N., 1977. Preliminary comments on the M.I.T. Public key cryptosystem. Cryptologia 1 (4), 406-414.
14. Xia, S., You, J., 2002. A group signature scheme with strong separability. J. Syst. Software 60, 177-182.