Strong unforgeability in group signature schemes

Computer Standards and Interfaces

Volumn 31, Issue 4, 2009, Pages 856-862

  Park, Haeryong ^a   Lim, Seongan ^b   Yie, Ikkwon ^b   Kim, Kitae ^b   Song, Junghwan ^c  

^a Korea Internet and Security Agency   (South Korea)

^b Inha University   (South Korea)

^c Hanyang University   (South Korea)

Author keywords

Cryptography; Group signature; ID based cryptosystem; Strong unforgeability

Indexed keywords

GROUP SIGNATURE; GROUP SIGNATURE SCHEMES; ID-BASED CRYPTOSYSTEM; SECURITY MODELS; SIGNATURE SCHEMES; STRONG UNFORGEABILITY;

CRYPTOGRAPHY;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 64249121138     PISSN: 09205489     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.csi.2008.09.019     Document Type: Article

References (21)

1. Ateniese G., Camenisch J., Joye M., and Tsudik G. A practical and provably secure coalition-resistant group signature scheme, in: CRYPTO'00. Lecture Notes in Computer Science vol. 1880 (2000), Springer, Berlin 255-270
2. An J.H., Dodis Y., and Rabin T. On the security of joint signature and encryption. EUROCRYPT'02. Lecture Notes in Computer Science vol. 2332 (2002), Springer, Berlin 83-107
3. Ateniese G., and de Medeiros B. Efficient group signatures without trapdoors. ASIACRYTP'03. Lecture Notes in Computer Science vol. 2894 (2003), Springer, Berlin 246-268
4. Ateniese G., and Tsudik G. Some Open issues and directions in group signature. FC'99. Lecture Notes in Computer Science vol. 1648 (1999), Springer, Berlin 196-211
5. Boneh D., Boyen X., and Shacham H. Short group signatures. CRYTPTO'04. Lecture Notes in Computer Science vol. 3152 (1985), Springer, Berlin 45-55
6. Boneh D., Goh E., and Nissim K. Evaluating 2-DNF formulas on ciphertexts. TCC'05. Notes in Computer Science vol. 3378 (2005), Springer, Berlin 325-342
7. Bellare M., Micciancio D., and Warinschi B. Foundations of group signatures: Formal definitions, simplified requirements and a construction based on general assumptions. EUROCRYPT'03. Lecture Notes in Computer Science vol. 2656 (2003), Springer, Berlin 614-629
8. Bellare M., and Rogaway P. Collision-resistant hashing: towards making UOWHFs practical. CRYPTO'97. Lecture Notes in Computer Science vol. 1294 (1997), Springer, Berlin 320-335
9. Bellare M., and Shoup S. Two-tier signatures, strongly unforgeable signatures, and Fiat-Shamir without random oracles. PKC'07. Lecture Notes in Computer Science vol. 4450 (2007), Springer, Berlin 201-216
10. Boneh D., Shen E., and Waters B. Strongly unforgeable signatures based on computational Diffie-Hellman. PKC'06. Lecture Notes in Computer Science vol. 3958 (2003), Springer, Berlin 229-240
11. Boyen X., and Waters B. Compact group signatures without random oracles. EUROCRYTPT'06. Lecture Notes in Computer Science vol. 4004 (2005), Springer, Berlin 427-444
12. Chaum D., and Heyst E.V. Group signatures. EUROCRYTPT'91. Lecture Notes in Computer Science vol. 547 (1991), Springer, Berlin 257-265
13. Chen Z., Huang J., Huang D., Zhang J., and Wang Y. Provably secure and ID-based group signature scheme. AINA'04 (2004), IEEE, New York 384-387
14. Chen T., and Pedersen T. New group signature schemes. EUROCRYPT'94. Lecture Notes in Computer Science vol. 950 (1994), Springer, Berlin 171-181
15. Park H., Chun K., and Ahn S. Cryptanalsis of the Hwang-Lo-Lin scheme based on an ID-based cryptosystem and its improvement. IEICE Trans. Communications E91-B(3) (2008) 900-903
16. Park H., Cao Z., Liu L., Lim S., Yie I., and Chun K. Cryptanalysis of two signature schemes based on bilinear pairings in CISC'05. INSCRYPT'06. Lecture Notes in Computer Science vol. 4318 (2006), Springer, Berlin 1-12
17. Nguyen L., and Safavi-Naini R. Efficient and provably secure trapdoor-free group signature schemes from bilinear pairings. Proceedings of ASIACRYTP'04. Lecture Notes in Computer Science vol. 3329 (2004), Springer, Berlin 372-386
18. Naor M., and Yung M. Universal one-way hash functions and their cryptographic applications. Proc. of the Twenty First ACM Symposium on Theory of Computing (1989), ACM 33-43
19. Matsuda T., Attrapadung N., Hanaoka G., Matsuura K., and Imai H. A CDH-Based strongly unforgeable signature without collision resistant hash function. ProvSec'07. Lecture Notes in Computer Science vol. 4784 (2007), Springer, Berlin 68-84
20. Simon D.R. Finding collision on one-way street: can secure hash functions be based on general assumptions?. EUROCRYPT'98. Lecture Notes in Computer Science vol. 1403 (1998), Springer, Berlin 334-345
21. Waters B. Efficient identity-based encryption without random oracles. EUROCRYTPT'05. Lecture Notes in Computer Science vol. 3494 (2005), Springer, Berlin 114-127