Leak-free group signatures with immediate revocation

Proceedings - International Conference on Distributed Computing Systems

Volumn 24, Issue , 2004, Pages 608-615

  Ding, Xuhua ^a,d   Tsudik, Gene ^b   Xu, Shouhuai ^c,d  

^a SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^b Irvine   (United States)

^c University of Texas at San Antonio   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; INTERFACES (COMPUTER); MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY SYSTEMS; THEOREM PROVING;

CREDENTIAL SYSTEMS; GROUP SIGNATURES; IMMEDIATE REVOCATION;

CRYPTOGRAPHY;

EID: 2442481842     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icdcs.2004.1281628     Document Type: Conference Paper

References (35)

1. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In CRYPTO'2000, pages 255-270.
2. G. Ateniese, D. Song, and G. Tsudik. Quasi-efficient revocation of group signatures. In Financial Crypto'02).
3. G. Ateniese and G. Tsudik. Some open issues and new directions in group signatures. In Financial Crypto'99).
4. M. Bellare, D. Micciancio, and B. Warinschi. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In EuroCrypto'2003.
5. J. Benaloh and D. Tuinstra. Receipt-free secret-ballot election (extended abstract). In STOC, 1994.
6. D. Boneh, X. Ding, G. Tsudik, and C. Wong. A method for fast revocation of public key certificates and security capabilities. In 10th USENIX Security Symposium, 2001.
7. E. Bresson and J. Stern. Group signatures with efficient revocation. In International Workshop on Practice and Theory in Public Key Cryptography (PKC) '2001.
8. J. Camenisch. Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. PhD thesis, ETH Zurich, 1998.
9. J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In CRYPTO'2002, pages 61-76.
10. J. Camenisch and A. Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In EuroCrypto'2001, pages 93-118.
11. J. Camenisch and A. Lysyanskaya. An identity escrow scheme with appointed verifiers. In CRYPTO'2001, pages 388-407.
12. J. Camenisch and M. Michels. A group signature scheme with improved efficiency (extended abstract). In Advances in Cryptology - ASIACRYPT '98.
13. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups (extended abstract). In CRYPTO'97, pages 410-424.
14. J. Camenisch and E. van Herreweghen. Design and implementation of the idemix anonymous credential system. In ACM CCS, 2002.
15. R. Canetti, C. Dwork, M. Naor, and R. Ostrovsky. Deniable encryption. In CRYPTO'97, pages 90-104.
16. D. Chaum. Security without identification: transaction systems to make big brother obsolete. Communications of the ACM, 28(10): 1030-1044, Oct. 1985.
17. D. Chaum and J. Evertse. A secure and privacy-protecting protocol for transmitting personal information between organizations. In CRYPTO '86, pages 118-167.
18. D. Chaum and E. van Heyst. Group signatures. In EuroCrypto'91, pages 257-265.
19. L. Chen and T. Pedersen. New group signature schemes. In EuroCrypto'94.
20. D. Clark and D. Wilson. A comparison of commercial and military computer security policies. In Proceedings of the IEEE Symposium on Research in Security and Privacy '87.
21. X. Ding, G. Tsudik, and S. Xu. Leak-free group signatures with immediate revocation. Full version of the present paper.
22. D. Dolev, C. Dwork, and M. Naor. Nonmalleable cryptography. In STOC, 1991.
23. M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed commit with one faulty process. Journal of the ACM, 32(2), 1985.
24. M. Franklin and T. Sander. Commital deniable proofs and electronic campaign finance. In Advances in Cryptology ASIACRYPT '2000.
25. J. Garay, M. Jakobsson, and P. MacKenzie. Abuse-free optimistic contract signing. In CRYPTO'99, pages 449-466.
26. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(1):270-299, 1984.
27. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2), 1998.
28. M. Hirt and K. Sako. Efficient receipt-free voting based on homomorphic encryption. In EuroCrypto'2000, pages 539-556.
29. J. Kilian and E. Petrank. Identity escrow. In CRYPTO'98, pages 169-185.
30. A. Lysyanskaya, R. Rivest, A. Sahai, and S. Wolf. Pseudonym systems. In 6th Annual Workshop on Selected Areas in Cryptography (SAC '99).
31. M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In STOC, 1990.
32. C. Rackoff and D. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In CRYPTO'91, pages 433-444.
33. D. Song. Practical forward-secure group signature schemes. In ACM CCS, 2001.
34. G. Tsudik and S. Xu. Accumulating composites and improved group signing. In Advances in Cryptology - ASIA-CRYPT '2003.
35. S. Xu and M. Yung. The dark side of threshold cryptography. In Financial Crypto (FC '02).