Group signatures: Better efficiency and new theoretical aspects

Lecture Notes in Computer Science

Volumn 3352, Issue , 2005, Pages 120-133

  Camenisch, Jan ^a   Groth, Jens ^b,c  

^a IBM RESEARCH   (United States)

^b Cryptomathic   (Denmark)

^c AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

PERSONNEL; SECURITY OF DATA; TELECOMMUNICATION NETWORKS;

ANONYMITY; GROUP SIGNATURE SCHEME; STATE-OF-THE-ART SCHEME;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 23944501377     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30598-9_9     Document Type: Conference Paper

References (21)

1. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure group signature scheme. In CRYPTO 2000, LNCS, vol. 1880, pp. 255-270.
2. G. Ateniese and B. de Medeiros. Efficient group signatures without trapdoors. In ASIACRYPT '03, LNCS, vol. 2894, pp. 246-268, 2003.
3. G. Ateniese, D. X. Song, and G. Tsudik. Quasi-efficient revocation in group signatures. In Financial Cryptography '02, pp. 183-197, 2002.
4. M. Bellare, D. Micciancio, and B. Warinschi. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In EUROCRYPT '03, LNCS vol. 2656, pp. 614-629.
5. D. Boneh, X. Boyen, and H. Shacham. Short group signatures using strong diffie hellman. In CRYPTO 2004, LNCS. Springer Verlag, 2004.
6. J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In CRYPTO '02, LNCS, vol. 2442.
7. J. Camenisch and A. Lysyanskaya. A signature scheme with efficient protocols. In SCN '02, LNCS, vol. 2576, pp. 268-289, 2002.
8. J. Camenisch and A. Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In CRYPTO 2004, LNCS. Springer Verlag, 2004.
9. J. Camenisch and M. Michels. A group signature scheme with improved efficiency. In ASIACRYPT '98, vol. 1514 of LNCS, pp. 160-174, 1998.
10. J. Camenisch and M. Stadier. Efficient group signature schemes for large groups. In CRYPTO '97, LNCS, vol. 1294, PP. 410-424, 1997.
11. D. Chaum and E. van Heyst. Group signatures. In EUROCRYPT '91, LNCS, vol. 547, pp. 257-265, 1991.
12. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO '86, LNCS, vol. 263, pp. 186-194, 1986.
13. O. Goldreich and V. Rosen. On the security of modular exponentiation with application to the construction of pseudorandom generators. Journal of Cryptology, 16(2):71-93, 2003.
14. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. on Comp., 17(2):281-308, Apr. 1988.
15. R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. In proceedings of STOC '89, pp. 44-61, 1989.
16. A. Kiayias, Y. Tsiounis, and M. Yung. Traceable signatures. Cryptology ePrint Archive, Report 2004/007, 2004. http://eprint.iacr.org/.
17. A. K. Lenstra and E. K. Verheul. Selecting cryptographic key sizes. Journal of Cryptology, 14(4):255-293, 2001.
18. A. Lysyanskaya. Unique signatures and verifiable random functions from the DHDDH separation. In CRYPTO 2002, LNCS, pp. 597-612, 2002.
19. D. Pointcheval and J. Stern. Security proofs for signature schemes. In EUROCRYPT '96, vol. 1070 of LNCS, pp. 387-398. Springer Verlag, 1996.
20. Trusted Computing Group. TCG TPM specification 1.2. Available at www.trustedcomputinggroup.org, 2003.
21. G. Tsudik and S. Xu. Accumulating composites and improved group signing. In proceedings of ASIACRYPT '03, LNCS series, volume 2894, PP. 269-286, 2003.