Foundations of group signatures: The case of dynamic groups

Lecture Notes in Computer Science

Volumn 3376, Issue , 2005, Pages 136-153

  Bellare, Mihir ^a   Shi, Haixia ^a   Zhang, Chong ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

GROUP SIGNATURES; PRACTICAL SCHEMES;

COMPUTER SCIENCE;

EID: 24144477851     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30574-3_11     Document Type: Conference Paper

References (29)

1. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. Advances in Cryptology - CRYPTO '00, Lecture Notes in Computer Science Vol. 1880, M. Bellare ed., Springer-Verlag, 2000.
2. G. Ateniese and G. Tsudik. Quasi-efficient revocation in group signature schemes. Financial Cryptography '02, Lecture Notes in Computer Science Vol. 2357, M. Blaze ed., Springer-Verlag, 2002.
3. G. Ateniese and G. Tsudik. Group signatures à la carte. Proceedings of the 10th Annual Symposium on Discrete Algorithms, ACM-SIAM, 1999.
4. G. Ateniese and G. Tsudik. Some open issues and directions in group signature. Financial Cryptography '99, Lecture Notes in Computer Science Vol. 1648, M. Franklin ed., Springer-Verlag, 1999.
5. M. Bellare, D. Micciancio and B. Warinschi. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. Advances in Cryptology - EUROCRYPT '03, Lecture Notes in Computer Science Vol. 2656, E. Biham ed., Springer-Verlag, 2003.
6. M. Bellare and S. Micali. How to sign given any trapdoor permutation. JACM, 39(1):214-233, 1992.
7. M. Bellare and P. Rogaway. Entity authentication and key distribution. Advances in Cryptology - CRYPTO '93, Lecture Notes in Computer Science Vol. 773, D. Stinson ed., Springer-Verlag, 1993.
8. M. Bellare, H. Shi, and C. Zhang. Foundations of group signatures: the case of dynamic groups. Full version of this abstract, http://www-cse.ucsd.edu/users/mihir.
9. M. Blum, A. DeSantis, S. Micali, and G. Persiano. Non-interactive zero-knowledge proof systems. SIAM J. on Computing, 20(6):1084-1118, 1991.
10. E. Bresson and J. Stern. Efficient revocation in group signatures. Public-Key Cryptography '01, Lecture Notes in Computer Science Vol. 1992, K. Kim ed., Springer-Verlag, 2001.
11. J. Camenisch. Efficient and generalized group signature. Advances in Cryptology - EUROCRYPT '97, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed., Springer-Verlag, 1997.
12. J. Camenisch and A. Lysyanskaya. An identity-escrow scheme with appointed verifiers. Advances in Cryptology - CRYPTO '01, Lecture Notes in Computer Science Vol. 2139, J. Kilian ed., Springer-Verlag, 2001.
13. J. Camenisch and M. Michels. A group signature scheme with improved efficiency. Advances in Cryptology - ASIACRYPT '98, Lecture Notes in Computer Science Vol. 1514, D. Pei ed., Springer-Verlag, 1998.
14. J. Camenisch and M. Stadler. Efficient group signatures schemes for large groups. Advances in Cryptology - CRYPTO '97, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed., Springer-Verlag, 1997.
15. D. Chaum and E. van Heyst. Group signatures. Advances in Cryptology - EUROCRYPT '91, Lecture Notes in Computer Science Vol. 547, D. Davies ed., Springer-Verlag, 1991.
16. L. Chen and T. P. Pedersen. New group signature schemes. Advances in Cryptology - EUROCRYPT '94, Lecture Notes in Computer Science Vol. 950, A. De Santis ed., Springer-Verlag, 1994.
17. D. Dolev, C. Dwork, and M. Naor. Nonmalleable cryptography. SIAM J. on Computing, 30(2):391-437, 2000.
18. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. Advances in Cryptology - CRYPTO '86, Lecture Notes in Computer Science Vol. 263, A. Odlyzko ed., Springer-Verlag, 1986.
19. O. Goldreich. A uniform-complexity treatment of encryption and zero-knowledge. J. of Cryptology, 6(1):21-53, 1993.
20. S. Goldwasser and S. Micali. Probabilistic encryption. JCSS, 28:270-299, 1984.
21. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. on Computing, 17(2):281-308, 1988.
22. S. Goldwasser and Y. Tauman. On the (In)security of the Fiat-Shamir paradigm. Proceedings of the 44th Symposium on Foundations of Computer Science, IEEE, 2003.
23. A. Kiayias, Y. Tsiounis and M. Yung. Traceable signatures. Advances in Cryptology - EUROCRYPT '04, Lecture Notes in Computer Science Vol. 3027, C. Cachin and J. Camenisch ed., Springer-Verlag, 2004.
24. S. Micali, C. Rackoff, and B. Sloan. The notion of security for probabilistic cryptosystems. SIAM J. on Computing, 17(2):412-426, 1988.
25. M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. Proceedings of the 22nd Annual Symposium on the Theory of Computing, ACM, 1990.
26. H. Petersen. How to convert any digital signature scheme into a group signature scheme. Proceedings of Security Protocols Workshop '97.
27. C. Rackoff and D. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. Advances in Cryptology - CRYPTO '91, Lecture Notes in Computer Science Vol. 576, J. Feigenbaum ed., Springer-Verlag, 1991.
28. A. Sahai. Non-malleable non-interactive zero knowledge and adaptive chosenciphertext security. Proceedings of the 40th Symposium on Foundations of Computer Science, IEEE, 1999.
29. D. Song. Practical forward-secure group signature schemes. Proceedings of the 8th Annual Conference on Computer and Communications Security, ACM, 2001.