Efficient secure group signatures with dynamic joins and keeping anonymity against group managers

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

Volumn 3715 LNCS, Issue , 2005, Pages 151-170

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

^a UNIVERSITY OF CONNECTICUT   (United States)

^b RSA   (United States)

^c Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; DATA PRIVACY; MATHEMATICAL MODELS; SECURITY OF DATA;

CRYPTOGRAPHIC DESIGN; FORMAL MODEL; SECURE GROUP SIGNATURES; SECURITY PROPERTIES;

CRYPTOGRAPHY;

EID: 33646202553     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11554868_11     Document Type: Conference Paper

References (30)

1. Michel Abdalla, Jee Hea An, Mihir Bellare, and Chanathip Namprempre. From identification to signatures via the fiat-shamir transform: Minimizing assumptions for security and forward-security. In Lars Knudsen, editor, Advances in Cryptology - EUROCRYPT ' 2002, volume 2332 of Lecture Notes in Computer Science, pages 418-433, Amsterdam, The Netherlands, 2002. Springer.
2. G. Ateniese and G. Tsudik. Some open issues and new directions in group signatures. In Matthew Franklin, editor, Financial cryptography: Third International Conference, FC '99, Anguilla, British West Indies, February 22-25, 1999: proceedings, volume 1648 of Lecture Notes in Computer Science, pages 196-211. Springer-Verlag, 1999.
3. Giuseppe Ateniese, Jan Camenisch, Marc Joye, and Gene Tsudik. A practical and provably secure coalition-resistant group signature scheme. In Mihir Bellare, editor, Advances in Cryptology - CRYPTO ' 2000, volume 1880 of Lecture Notes in Computer Science. International Association for Cryptologic Research, Springer, 2000.
4. Mihir Bellare, Daniele Micciancio, and Bogdan Warinschi. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In Eli Biham, editor, Advances in Cryptology - EURO-CRYPT 2003, volume 2656 of Lecture Notes in Computer Science, Warsaw, Poland, 2003. Springer.
5. Dan Boneh. The decision diffie-hellman problem. In the Third Algorithmic Number Theory Symposium, volume 1423 of Lecture Notes in Computer Science, pages 48-63. Springer-Verlag, 1998.
6. Dan Boneh, Xavier Boyen, and Hovav Shacham. Short group signatures. In Matthew Franklin, editor, Advances in Cryptology - CRYPTO ' 2004, Lecture Notes in Computer Science. International Association for Cryptologic Research, Springer-Verlag, 2004.
7. Fabrice Boudot. Efficient proofs that a committed number lies in an interval. In Bart Preneel, editor, Advances in Cryptology - EUROCRYPT 8000, volume 1807 of Lecture Notes in Computer Science, pages 431-444. Springer-Verlag, 2000.
8. Jan Camenisch. Efficient and generalized group signatures. In Walter Fumy, editor, Advances in Cryptology - EUROCRYPT '97, International Conference on the Theory and Application of Cryptographic Techniques, Lecture Notes in Computer Science, pages 465-479. International Association for Cryptologic Research, Springer, 1997.
9. Jan Camenisch and Anna Lysyanskaya. An identity escrow scheme with appointed verifiers. In Joe Kilian, editor, Advances in Cryptology - CRYPTO ' 2001, volume 2139 of Lecture Notes in Computer Science, pages 388-407. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, 2001.
10. Jan Camenisch and Markus Michels. A group signature scheme with improved efficiency. In Kazuo Ohta and Dingyi Pei, editors, ASIACRYPT: Advances in Cryptology - ASIACRYPT: International Conference on the Theory and Application of Cryptology, volume 1514 of Lecture Notes in Computer Science, pages 160-174. International Association for Cryptologic Research, Springer-Verlag, 1998.
11. Jan Camenisch and Markus Michels, Separability and efficiency for generic group signature schemes (extended abstract). In Michael j. Wiener, editor, 19th International Advances in Cryptology Conference - CRYPTO '99, volume 1666 of Lecture Notes in Computer Science, pages 413-430. Springer, 1999.
12. Jan Camenisch and Markus Stadler. Efficient group signature schemes for large groups. Lecture Notes in Computer Science, 1294:410-424, 1997.
13. D. Chaum and E. van Heyst. Group signatures. In D. W. Davies, editor, Advances in Cryptology, Proc. of Eurocrypt '91 (Lecture Notes in Computer Science 547), pages 257-265. Springer-Verlag, April 1991. Brighton, U.K.
14. L. Chen and T. P. Pedersen. New group signature schemes (extended abstract). In Alfredo De Santis, editor, Advances in Cryptology - EUROCRYPT 94, volume 950 of Lecture Notes in Computer Science, pages 171-181. Springer-Verlag, 1995, 9-12 May 1994.
15. Ronald Cramer and Victor Shoup. Signature schemes based on the strong RSA assumption. ACM Transactions on Information and System Security, 3(3): 161-185, August 2000.
16. Danny Dolev, Cynthia Dwork, and Moni Naor. Non-malleable cryptography (extended abstract). In Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, pages 542-552, New Orleans, Louisiana, 6-8 May 1991.
17. Danny Dolev, Cynthia Dwork, and Moni Naor. Non-malleable cryptography. SICOMP, 30(2):391-437, 2000. A preliminary version appeared in 23rd STOC, 1991.
18. Amos Fiat and Adi Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In Proceedings of CRYPTO'86, volume 263 of Lecture Notes in Computer Science, pages 186-194. Springer Verlag, 1986.
19. Pierre-Alain Fouque and David Pointcheval. Threshold cryptosystems secure against chosen-ciphertext attacks. In ASIACRYPT: Advances in Cryptology -ASIACRYPT: International Conference on the Theory and Application of Cryptology, volume 2248 of Lecture Notes in Computer Science, pages 351-368. Springer Verlag, 2001.
20. Oded Goldreich. On the foundations of modern cryptography. In Proc. 17th Annual International Cryptology Conference - CRYPTO '97, pages 46-74, 1997.
21. Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer Security, 28:270-299, 1984.
22. Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest. A "paradoxical" solution to the signature problem (extended abstract). In 25th Annual Symposium on Foundations of Computer Science, pages 441-448, Singer Island, Florida, 24-26 October 1984. IEEE.
23. Aggelos Kiayias, Yiannis Tsiounis, and Moti Yung. Traceable signatures. In Christian Cachin and Jan Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 571-589, Interlaken, Switzerland, 2004. Springer.
24. Aggelos Kiayias and Moti Yung. Extracting group signatures from traitor tracing schemes. In Eli Biham, editor, Advances in Cryptology - EUROCRYPT 2003, volume 2656 of Lecture Notes in Computer Science, pages 630-648, Warsaw, Poland, 2003. Springer.
25. Aggelos Kiayias and Moti Yung. Group signatures: Provable security, efficient constructions and anonymity from trapdoor-holders. Cryptology ePrint Archive, Report 2004/076, 2004.http://eprint.iacr.org/.
26. Joe Kilian and Erez Petrank. Identity escrow. In Hugo Krawczyk, editor, Advances in Cryptology - CRYPTO ' 1998, volume 1462 of Lecture Notes in Computer Science, pages 169-185. International Association for Cryptologic Research, Springer, 1998.
27. Kevin S. McCurley. A key distribution system equivalent to factoring. Journal of Cryptology: the journal of the International Association for Cryptologic Research, 1(2):95-105, 1988.
28. M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In Baruch Awerbuch, editor, Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, pages 427-437, Baltimore, MY, May 1990. ACM Press.
29. David Pointcheval and Jacques Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, 13(3):361-396, March 2000.
30. Charles Rackoff and Daniel R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In Joan Feigenbaum, editor, Advances in Cryptology - CRYPTO ' 91, volume 576 of Lecture Notes in Computer Science, pages 433-444. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, 1992.