Linkable democratic group signatures

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

Volumn 3903 LNCS, Issue , 2006, Pages 187-201

  Manulis, Mark ^a   Sadeghi, Ahmad Reza ^a   Schwenk, Jörg ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Anonymity; Democratic group signatures; Group communication; Linkability; Pseudonymity

Indexed keywords

CRYPTOGRAPHY; INFORMATION THEORY; MATHEMATICAL MODELS; RANDOM PROCESSES; SECURITY OF DATA;

ANONYMITY; DEMOCRATIC GROUP SIGNATURES; GROUP COMMUNICATION; LINKABILITY; PSEUDONYMITY;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33745600128     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11689522_18     Document Type: Conference Paper

References (22)

1. Y. Amir, Y. Kim, C. Nita-Rotaru, and G. Tsudik. On the performance of group key agreement protocols. ACM Transactions on Information and System Security, 7(3):457-488, 2004.
2. M. Bellare, D. Micciancio, and B. Warinschi. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In Advances in Cryptology (EUROCRYPT 2003),Lecture Notes in Computer Science, volume 2656, pages 614-629. Springer-Verlag, 2003.
3. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proceedings of the 1st ACM conference on Computer and communications security, pages 62-73. ACM Press, 1993.
4. M. Bellare, H. Shi, and C. Zhang. Foundations of group signatures: The case of dynamic groups. In CT-RSA, Lecture Notes in Computer Science, volume 2656, pages 136-153. Springer-Verlag, 2005.
5. A. Bender, J. Katz, and R. Morselli. Ring signatures: Stronger definitions, and constructions without random oracles. In Theory of Cryptography Conference 2006 (to appear), Lecture Notes in Computer Science. Springer-Verlag, 2006.
6. D. Boneh. The Decision Diffie-Hellman problem. In ANTS-III: Proceedings of the Third International Symposium on Algorithmic Number Theory, pages 48-63. Springer-Verlag, 1998.
7. D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In Advances in Cryptology - CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science, pages 41-55. Springer-Verlag, 2004.
8. J. Camenisch and J. Groth. Group signatures: Better efficiency and new theoretical aspects. In SCN, Lecture Notes in Computer Science, volume 3352, pages 120-133. Springer-Verlag, 2004.
9. J. Camenisch and M. Michels. A group signature scheme with improved efficiency. In Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security, pages 160-174. Springer-Verlag, 1998.
10. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology, Lecture Notes in Computer Science, volume 1294, pages 410-424. Springer-Verlag, 1997.
11. D. Chaum and E. van Heyst. Group signatures. In Advances in Cryptology (EUROCRYPT 1991),Lecture Notes in Computer Science, volume 547, pages 257-265. Springer-Verlag, 1991.
12. U. Feige, D. Lapidot, and A. Shamir. Multiple non-interactive zero knowledge proofs under general assumptions. SIAM Journal on Computing, 29(1):1-28, September 1999.
13. E.-J. Goh and S. Jarecki. A signature scheme as secure as the Diffie-Hellman problem. In Advances in Cryptology - EUROCRYPT 2003, volume 2656 of Lecture Notes in Computer Science, pages 401-415. Springer-Verlag, 2003.
14. J. Katz and M. Yung. Scalable protocols for authenticated group key exchange. In Advances in Cryptology (CRYPTO 2003),Lecture Notes in Computer Science, volume 2729 of Lecture Notes in Computer Science, pages 110-125. Springer-Verlag, 2003.
15. A. Kiayias, Y. Tsiounis, and M. Yung. Traceable signatures. In Advances in Cryptology (EUROCRYPT 2004), volume 3027 of Lecture Notes in Computer Science, pages 571-589. Springer-Verlag, 2004.
16. A. Kiayias and M. Yung. Group signatures with efficient concurrent join. In Advances in Cryptology - EUROCRYPT2005, volume 3494 of Lecture Notes in Computer Science, pages 198-214. Springer-Verlag, 2005.
17. Y. Kim, A. Perrig, and G. Tsudik. Tree-based group key agreement. ACM Transactions on Information and System Security, 7(1):60-96, 2004.
18. J. K. Liu, V. K. Wei, and D. S. Wong. Linkable spontaneous anonymous group signature for ad hoc groups (extended abstract). In Information Security and Privacy: 9th Australasian Conference, ACISP 2004., volume 3108 of Lecture Notes in Computer Science, pages 325-335. Springer-Verlag, 2004.
19. A. Lysyanskaya, R. L. Rivest, A. Sahai, and S. Wolf. Pseudonym systems. In Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography, pages 184-199. Springer-Verlag, 2000.
20. M. Manulis. Democratic Group Signatures (On an Example of Joint Ventures - Fast Abstract). In Fast Abstracts Proceedings of ACM Symposium on Information, Computer and Communications Security (ASIACCS'06). ACM Press, 2006. Full version at: http://eprint.iacr.org/20057446.
21. R. L. Rivest, A. Shamir, and Y. Tauman. How to leak a secret. In ASIACRYPT'01: Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security, volume 2248 of Lecture Notes in Computer Science, pages 552-565. Springer-Verlag, 2001.
22. A. Sahai. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, page 543. IEEE Computer Society, 1999.