Traceable signature: Better efficiency and beyond

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

Volumn 3982 LNCS, Issue , 2006, Pages 327-337

  Ge, He ^a   Tate, Stephen R ^a  

^a Center for Advanced Research and Technology   (United States)

Author keywords

Anonymous Authentication; Cryptographic Protocol; Group signature; Traceable Signature; Variable Anonymity

Indexed keywords

COMPUTER SCIENCE; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MATHEMATICAL MODELS; SECURITY OF DATA;

ANONYMOUS AUTHENTICATION; CRYPTOGRAPHIC PROTOCOL; GROUP SIGNATURE; TRACEABLE SIGNATURE; VARIABLE ANONYMITY;

CRYPTOGRAPHY;

EID: 33745888082     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11751595_36     Document Type: Conference Paper

References (15)

1. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In Advances in Cryptology - Crypto, pages 255-270, 2000.
2. N. Baric and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Advances in Cryptology -Eurocrypto, pages 480-494,1997.
3. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient procotols. In ACM Conference on Computer and Communication Security, pages 62-73, 1993.
4. E. Brickell, J. Camenisch, and L. Chen. Direct anonymous attestation. In ACM Conference on Computer and Communications Security, pages 132-145, 2004.
5. J. Camenisch and J. Groth. Group signatures: Better efficiency and new theoretical aspects. In Security in Communication Networks (SCN 2004), LNCS 3352, pages 120-133, 2005.
6. J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Advances in Cryptology - Crypto'02, LNCS 2442, pages 61-76, 2002.
7. J. Camenisch and A. Lysyanskaya. A signature scheme with efficient protocols. In SCN'02, LNCS 2576, pages 268-289, 2002.
8. J. Camenisch and M. Stadler. A group signature scheme with improved efficiency. In Advances in Cryptology -ASIACRYPT'98, LNCS 1514, pages 160-174, 1998.
9. A. Chan, Y. Frankel, and Y. Tsiounis. Easy come - easy go divisible cash. In K. Yyberg, editor, Advances in Cryptology - Eurocrypt'98, LNCS 1403, pages 561-574. Sringer-Verlag, 1998.
10. D. Chaum and E. van Heyst. Group signature. In Advances in Cryptology -Eurocrypt, pages 390-407,1992.
11. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In Advances in Cryptology - Crypto, pages 10-18, 1984.
12. A. Fiat and A. Shamir. How to prove yourself, practical solutions to identification and signature problems. In Advances in Cryptology - CRYPTO'86, LNCS 263, pages 186-194. Springer-Verlag, 1987.
13. E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology - Crypto, pages 16-30, 1997.
14. A. Kiayias, Y. Tsiounis, and M. Yung. Traceable signatures. In Advances in Cryptology Eurocypt, LNCS 3027, pages 571-589. Springer-Verlag, 2004.
15. TCG. http://www.trustedcomputinggroup.org.