Traceable signatures

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

Volumn 3027, Issue , 2004, Pages 571-589

  Kiayias, Aggelos ^a   Tsiounis, Yiannis ^b   Yung, Moti ^c  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b Etolian Capital Management   (United States)

^c Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

EFFICIENT IMPLEMENTATION; GROUP SIGNATURES; PROVABLY SECURE; SECURITY MODEL; SECURITY PROOFS; SIGNATURE SCHEME; STATE OF THE ART; ZERO KNOWLEDGE PROOF;

NETWORK SECURITY;

EID: 35048841283     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24676-3_34     Document Type: Article

References (25)

1. M. Abdalla, J. H. An, M. Bellare, and C. Namprempre. From identification to signatures via the Fiat-Shamir transform: Minimizing assumptions for security and forward-security. In L. Knudsen, editor, Advances in Cryptology - EUROCRYPT 2002, volume 2332 of LNCS, pages 418-433. Springer-Verlag, 2002.
2. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In M. Bellare, editor, Advances in Cryptology - CRYPTO 2000, volume 1880 of LNCS, pages 255-270, 2000.
3. G. Ateniese, G. Song, and G. Tsudik. Quasi-efficient revocation of group signatures. In M. Blaze, editor, Financial Cryptography 2002, volume 2357 of LNCS, pages 183-197, 2002.
4. G. Ateniese and G. Tsudik. Some open issues and new directions in group signatures. In M. Franklin, editor, Financial Cryptography 1999, volume 1648 of LNCS, pages 196-211. 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. In E. Biham, editor, Advances in Cryptology - EUROCRYPT 2003, volume 2656 of LNCS, pages 614-629. Springer, 2003.
6. F. Boudot. Efficient proofs that a committed number lies in an interval. In B. Preneel, editor, Advances in Cryptology - EUROCRYPT 2000, volume 1807 of LNCS, pages 431-444. Springer-Verlag, 2000.
7. J. Camenisch. Efficient and generalized group signatures. In W. Fumy, editor, Advances in Cryptology - EUROCRYPT 1997, volume 1233 of LNCS, pages 465-479. Springer, 1997.
8. J. Camenisch and A. Lysyanskaya. An identity escrow scheme with appointed verifiers. In J. Kilian, editor, Advances in Cryptology - CRYPTO 2001, volume 2139 of LNCS, pages 388-4107. Springer, 2001.
9. J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In M. Yung, editor, Advances in Cryptology - CRYPTO 2002, volume 2442 of LNCS, pages 61-76. Springer, 2002.
10. J. Camenisch and A. Lysyanskaya. A signature scheme with efficient protocols. In S. Cimato, C. Galdi, and G. Persiano, editors, International Conference on Security in Communication Networks - SCN 2002, volume 2576 of LNCS, pages 268-289. Springer Verlag, 2002.
11. J. Camenisch and M. Michels. A group signature scheme based on an RSA-variant. BRICS Technical Report, RS98-27, 1998.
12. J. Camenisch and M. Michels. A group signature scheme with improved efficiency. In K. Ohta and D. Pei, editors, Advances in Cryptology - ASIACRYPT 1998, volume 1514 of LNCS, pages 160-174. Springer, 1998.
13. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In B. Kaliski, editor, Advances in Cryptology -CRYPTO 1997, LNCS, pages 410-424. Springer-Verlag, 1997.
14. D. Chaum and E. van Heyst. Group signatures. In D. W. Davies, editor, Advances in Cryptology - EUROCRYPT 1991, volume 547 of LNCS, pages 257-265. Springer-Verlag, 1991.
15. L. Chen and T. P. Pedersen. New group signature schemes (extended abstract). In A. De Santis, editor, Advances in Cryptology-EUROCRYPT 1994, volume 950 of LNCS, pages 171-181. Springer-Verlag, 1994.
16. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Y. G. Desmedt, editor, Advances in Cryptology -CRYPTO 1994, volume 839 of LNCS, pages 174-187. Springer-Verlag, 1994.
17. I. Damgård and E. Fujisaki. A statistically-hiding integer commitment scheme based on groups with hidden order. In Y. Zheng, editor, Advances in Cryptology-ASIACRYPT 2002, volume 2501 of LNCS, pages 125-142. Springer-Verlag, 2002.
18. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In A. Odlyzko, editor, Advances in Cryptology - CRYPTO 1986, volume 263 of LNCS, pages 186-194. Springer-Verlag, 1987.
19. E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. S. Kaliski, editor, Advances in Cryptology - CRYPTO 1997, volume 1294 of LNCS, pages 16-30, 1997.
20. O. Goldreich. Secure multi-party computation, manuscript available from the web. http://www.wisdom.weizmann.ac.il/̃oded/, 1998.
21. J. Groth. Group signatures: revisiting definitions, assumptions and revocation, 2004. manuscript.
22. J. Håstad, A. W. Schrift, and A. Shamir. The discrete logarithm modulo a composite hides O(n) bits. JCSS: Journal of Computer and System Sciences, 47(3):376-404, 1993.
23. M. Jakobsson, K. Sako, and R. Impagliazzo. Designated verifier proofs and their applications. In U. M. Maurer, editor, Advances in Cryptology - EUROCRYPT 1996, volume 1070 of LNCS, pages 143-154, 1996.
24. A. Kiayias, Y. Tsiounis, and M. Yung. Traceable signatures. E-Print Cryptology Archive, Report 2004/007, 2004. http://eprint.iacr.org/.
25. A. Kiayias and M. Yung. Extracting group signatures from traitor tracing schemes. In E. Biham, editor, Advances in Cryptology - EUROCRYPT 2003, volume 2656 of LNCS, pages 630-648. Springer, 2003.