On the minimal assumptions of group signature schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3269, Issue , 2004, Pages 1-13

  Abdalla, Michel ^a   Warinschi, Bogdan ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b University of California Santa Cruz   (United States)

Author keywords

Group signatures; Minimal assumptions; One way functions; Trapdoor permutations

Indexed keywords

CRYPTOGRAPHY; NETWORK SECURITY;

GROUP SIGNATURE SCHEME; GROUP SIGNATURES; MINIMAL ASSUMPTIONS; ONE-WAY FUNCTIONS; PUBLIC-KEY ENCRYPTION SCHEME; SIGNATURE SCHEME; TRAPDOOR PERMUTATIONS;

AUTHENTICATION;

EID: 33646840349     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30191-2_1     Document Type: Article

References (31)

1. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In M. Bellare, editor, CRYPTO 2000, volume 1880 of LNCS, pages 255-270, Santa Barbara, CA, USA, Aug. 20-24, 2000. Springer-Verlag, Berlin, Germany.
2. G. Ateniese and G. Tsudik. Group signatures Á la carte. In ACM, editor, 10th SODA, pages 848-849, Baltimore, Maryland, USA, Jan. 17-19, 1999. ACM-SIAM.
3. G. Ateniese and G. Tsudik. Some open issues and new directions in group signatures. In M. Franklin, editor, FC'99, volume 1648 of LNCS, pages 196-211, Anguilla, British West Indies, Feb. 1999. Springer-Verlag, Berlin, Germany.
4. B. Barak. How to go beyond the black-box simulation barrier. In IEEE, editor, 42nd FOCS, pages 106-115, Las Vegas, USA, Oct. 14-17, 2001. IEEE Computer Society Press.
5. B. Barak. Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In IEEE, editor, 43nd FOCS, pages 345-355, Vancouver, Canada, Nov. 16-19, 2002. IEEE Computer Society Press.
6. B. Barak, O. Goldreich, S. Goldwasser, and Y. Lindell. Resettably-sound zero-knowledge and its applications. In IEEE, editor, 42nd FOCS, pages 116-125, Las Vegas, USA, Oct. 14-17, 2001. IEEE Computer Society Press.
7. M. Bellare, S. Halevi, A. Sahai, and S. P. Vadhan. Many-to-one trapdoor functions and their ralation to public-key cryptosystems. In H. Krawczyk, editor, CRYPTO'98, volume 1462 of LNCS, pages 283-298, Santa Barbara, CA, USA, Aug. 23-27, 1998. Springer-Verlag, Berlin, Germany.
8. M. Bellare and S. Micali. How to sign given any trapdoor function. Journal of the ACM, 39(1):214-233, 1992.
9. M. Bellare, D. Micciancio, and B. Warinschi. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In E. Biham, editor, EUROCRYPT 2003, volume 2656 of LNCS, pages 614-629, Warsaw, Poland, May 4-8, 2003. Springer-Verlag, Berlin, Germany.
10. M. Bellare, H. Shi, and C. Zhang. Foundations of group signatures: The case of dynamic groups. Cryptology ePrint Archive, Report 2004/077, 2004. http: //eprint.iacr.org/.
11. D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In M. Franklin, editor, CRYPTO 2004, LNCS, Santa Barbara, CA, USA, Aug. 15-19, 2004. Springer-Verlag, Berlin, Germany.
12. E. Bresson and J. Stern. Efficient revocation in group signatures. In K. Kim, editor, PKC 2001, volume 1992 of LNCS, pages 190-206, Cheju Island, South Korea, Feb. 13-15, 2001. Springer-Verlag, Berlin, Germany.
13. J. Camenisch. Efficient and generalized group signatures. In W. Fumy, editor, EUROCRYPT'97, volume 1233 of LNCS, pages 465-479, Konstanz, Germany, May 11-15, 1997. Springer-Verlag, Berlin, Germany.
14. D. Chaum and E. van Heyst. Group signatures. In D. W. Davies, editor, EUROCRYPT'91, volume 547 of LNCS, pages 257-265, Brighton, UK, Apr. 8-11, 1991. Springer-Verlag, Berlin, Germany.
15. L. Chen and T. P. Pedersen. New group signature schemes. In A. D. Santis, editor, EUROCRYPT'94, volume 950 of LNCS, pages 171-181, Perugia, Italy, May 9-12, 1994. Springer-Verlag, Berlin, Germany.
16. W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22:644-654, 1978.
17. Y. Gertner, S. Kannan, T. Malkin, O. Reingold, and M. Viswanathan. The relationship between public key encryption and oblivious transfer. In IEEE, editor, 41st FOCS, pages 325-335, Las Vegas, USA, Nov. 12-14, 2000. IEEE Computer Society Press.
18. Y. Gertner, T. Malkin, and O. Reingold. On the impossibility of basing trapdoor functions on trapdoor predicates. In IEEE, editor, 42nd FOCS, pages 126-135, Las Vegas, USA, Oct. 14-17, 2001. IEEE Computer Society Press.
19. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In IEEE, editor, 27th FOCS, pages 174-187. IEEE Computer Society Press, 1986.
20. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 38(3):691-729, 1991.
21. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Science, 28:270-299, 1984.
22. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281-308, Apr. 1988.
23. S. Halevi and H. Krawczyk. Public-key cryptography and password protocols. In ACM Transactions on Information and System Security, pages 524-543. ACM, 1999.
24. R. Impagliazzo and M. Luby. One-way functions are essential for complexity-based cryptography. In IEEE, editor, 30th FOCS, pages 230-235. IEEE Computer Society Press, 1989.
25. R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. In ACM, editor, 21st ACM STOC, pages 44-61, Seattle, Washington, USA, May 15-17, 1989. ACM Press.
26. A. Kiayias and M. Yung. Extracting group signatures from traitor tracing schemes. In E. Biham, editor, EUROCRYPT 2003, volume 2656 of LNCS, pages 630-648, Warsaw, Poland, May 4-8, 2003. Springer-Verlag, Berlin, Germany.
27. A. Kiayias and M. Yung. Group signatures: Provable security, efficient constructions and anonymity from trapdoor-holders. Cryptology ePrint Archive, Report 2004/076, 2004. http://eprint.iacr.org/.
28. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In ACM, editor, 21st ACM STOC, pages 33-43, Seattle, Washington, USA, May 15-17, 1989. ACM Press.
29. O. Reingold, L. Trevisan, and S. P. Vadhan. Notions of reducibility between cryptographic primitives. In M. Naor, editor, TCC 2004, volume 2951 of LNCS, pages 1-20, Cambridge, MA, USA, Feb. 19-21, 2004. Springer-Verlag, Berlin, Germany.
30. J. Rompel. One-way functions are necessary and sufficient for secure signatures. In ACM, editor, 22nd ACM STOC, pages 387-394, Baltimore, Maryland, USA, May 14-16, 1990. ACM Press.
31. A. C. Yao. Theory and applications of trapdoor functions. In IEEE, editor, 23rd FOCS, pages 80-91. IEEE Computer Society Press, 1982.