Secure scalable group signature with dynamic joins and separable authorities

International Journal of Security and Networks

Volumn 1, Issue 1-2, 2006, Pages 24-45

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

^a UNIVERSITY OF CONNECTICUT   (United States)

^b RSA   (United States)

^c Columbia University ^*  (United States)

Author keywords

anonymity; digital signatures; group signatures; privacy; Strong RSA

Indexed keywords

EID: 54249117650     PISSN: 17478405     EISSN: 17478413     Source Type: Journal    
DOI: 10.1504/ijsn.2006.010821     Document Type: Article

References (33)

1. Abdalla, M., An, J.H., Bellare, M. and Namprempre, C. (2002) ‘From identification to signatures via the fiatshamir transform: minimizing assumptions for security and forward–security’, in L. Knudsen (Ed). Advances in Cryptology – EUROCRYPT’02, Vol. 2332, Lecture Notes in Computer Science, Amsterdam, The Netherland: Springer, pp.418–433.
2. Ateniese, G., Camenisch, J., Joye, M. and Tsudik, G. (2000) ‘A practical and provably secure coalition-resistant group signature scheme’, in M. Bellare (Ed). Advances in Cryptology CRYPTO ’00, Vol. 1880, Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer.
3. Ateniese, G. and Tsudik, G. (1999) ‘Some open issues and new directions in group signatures’, in M. Franklin (Ed). Financial cryptography: Third International Conference, FC ’99, Anguilla, British West Indies, February 22–25, proceedings, Vol. 1648, Lecture Notes in Computer Science, Springer-Verlag, pp.196–211.
4. Bellare, M., Micciancio, D. and Warinschi, B. (2003) ‘Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions’, in E. Biham (Ed). Advances in Cryptology – EUROCRYPT 03, Vol. 2656, Lecture Notes in Computer Science, Warsaw, Poland: Springer.
5. Bellare, M., Shi, H. and Zhang, C. (2005) ‘Foundations of group signatures: the case of dynamic groups’, in A. Menezes (Ed). CT-RSA, Vol. 3376, Lecture Notes in Computer Science, Springer, pp.136–153.
6. Boneh, D. (1998) ‘The decision diffie-hellman problem’, in J. Buhler (Ed). the Third Algorithmic Number Theory Symposium, Vol. 1423, Lecture Notes in Computer Science, Springer-Verlag, pp.48–63.
7. Boneh, D., Boyen, X. and Shacham, H. (2004) ‘Short group signatures’, in M. Franklin (Ed). Advances in Cryptology – CRYPTO’ 04, Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer-Verlag.
8. Camenisch, J. (1997) ‘Efficient and generalized group signatures’, in W. Fumy (Ed). Advances in Cryptology – EUROCRYPT ’97, International Conference on the Theory and Application of Cryptographic Techniques, Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer, pp.465–479.
9. Camenisch, J. and Lysyanskaya, A. (2001) ‘An identity escrow scheme with appointed verifiers’, in J. Kilian (Ed). Advances in Cryptology – CRYPTO ’ 01, Vol. 2139, Lecture Notes in Computer Science, International Association for Cryptologic Research, Berlin, Germany: Springer-Verlag, pp.388–407.
10. Camenisch, J. and Michels, M. (1998) ‘A group signature scheme with improved efficiency’, in K. Ohta (Ed). ASIACRYPT: Advances in Cryptology – ASIACRYPT: International Conference on the Theory and Application of Cryptology, Vol. 1514, Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer-Verlag, pp.160–174.
11. Camenisch, J. and Michels, M. (1999) ‘Separability and efficiency for generic group signature schemes (extended abstract)’, in M.J. Wiener, (Ed). 19th Internaional Advances in Cryptology Conference – CRYPTO ’99, Vol. 1666, Lecture Notes in Computer Science, Springer, pp.413–430.
12. Camenisch, J. and Stadler, M. (1997) ‘Efficient group signature schemes for large groups’, in B.S. Kaliski Jr. (Ed). Advances in Cryptology – CRYPTO ’97, 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17–21, 1997, Proceedings Lecture Notes in Computer Science 1294 Springer 1997, pp.410–424.
13. Chaum, D. and van Heyst, E. (1991) ‘Group signatures’, in D.W. Davies (Ed). Advances in Cryptology, Proceedings of Eurocrypt ’91, (Lecture Notes in Computer Science 547), Brighton, UK: Springer-Verlag, pp.257–265.
14. Chen, L. and Pedersen, T.P. (1994) ‘New group signature schemes (extended abstract)’, in A. De Santis (Ed). Advances in Cryptology – EUROCRYPT ’94, Vol. 950, Lecture Notes in Computer Science, Springer-Verlag, 1995, pp.171–181.
15. Cramer, R. and Shoup, V. (2000) ‘Signature schemes based on the strong RSA assumption’, ACM Transactions on Information and System Security, Vol. 3, No. 3, pp.161–185.
16. Dolev, D., Dwork, C. and Naor, M. (1991) ‘Non-malleable cryptography (extended abstract)’, Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, New Orleans, LA, pp.542–552.
17. Dolev, D., Dwork, C. and Naor, M. (2000) ‘Non-malleable cryptography’, J. Siam SICOMP, A preliminary version appeared in 23rd STOC, 1991, Vol. 30, No. 2, pp.391–437.
18. Fiat, A. and Shamir, A. (1986) ‘How to prove yourself: practical solutions to identification and signature problems’, A.M. Odlyzko (Ed). Proceedings of CRYPTO’86, Vol. 263, Lecture Notes in Computer Science, Springer Verlag, pp.186–194.
19. Fouque, P-A. and Pointcheval, D. (2001) ‘Threshold cryptosystems secure against chosen-ciphertext attacks’, C. Boyd (Ed). ASIACRYPT: Advances in Cryptology – ASIACRYPT: International Conference on the Theory and Application of Cryptology, Vol. 2248, Lecture Notes in Computer Science, Springer Verlag, pp.351–368.
20. Goldreich, O. (1997) ‘On the foundations of modern cryptography’, in B.S. Kaliski Jr. (Ed). Advances in Cryptology – CRYPTO ’97, 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17–21, 1997, Proceedings Lecture Notes in Computer Science 1294 Springer 1997, pp.46–74.
21. Goldwasser, S. and Micali, S. (1984) ‘Probabilistic encryption’, Journal of Computer Security, Vol. 28, pp.270–299.
22. Goldwasser, S., Micali, S. and Rivest, R.L. (1984) ‘A “Paradoxical” solution to the signature problem (extended abstract)’, 25th Annual Symposium on Foundations of Computer Science, Singer Island, FL: IEEE, pp.441–448.
23. Kiayias, A., Tsiounis, Y. and Yung, M. (2004) ‘Traceable signatures’, in C. Cachin and J. Camenisch (Eds). Advances in Cryptology – EUROCRYPT ’ 04, Vol. 3027, Lecture Notes in Computer Science, Interlaken, Switzerland: Springer, pp.571–589.
24. Kiayias, A. and Yung, M. (2003) ‘Extracting group signatures from traitor tracing schemes’, in E. Biham (Ed). Advances in Cryptology – EUROCRYPT’ 03, Vol. 2656, Lecture Notes in Computer Science, Warsaw, Poland: Springer, pp.630–648.
25. Kiayias, A. and Yung, M. (2004) ‘Group signatures: provable security, efficient constructions and anonymity from trapdoorholders’, E. Dawson and S. Vaudenay (Eds). Cryptology ePrint Archive, Report 04/076, Available at: http://eprint.iacr.org/.
26. Kiayias, A. and Yung, M. (2005) ‘Efficient secure group signatures with dynamic joins and keeping anonymity against group managers’, Progress in Cryptology – Mycrypt 2005, First International Conference on Cryptology in Malaysia, Kuala Lumpur, Malaysia, 28–30 September, Proceedings, Vol. 3715, Lecture Notes in Computer Science, Springer, pp.151–170.
27. Kilian, J. and Petrank, E. (1998) ‘Identity escrow’, in H. Krawczyk (Ed). Advances in Cryptology – CRYPTO ’ 98, Vol. 1462, Lecture Notes in Computer Science, International Association for Cryptologic Research, Springer, pp.169–185.
28. McCurley, K.S. (1988) ‘A key distribution system equivalent to factoring’, Journal of Cryptology: The Journal of the International Association for Cryptologic Research, Vol. 1, No. 2, pp.95–105.
29. Naor, M. and Yung, M. (1990) ‘Public-key cryptosystems provably secure against chosen ciphertext attacks’, in B. Awerbuch (Ed). Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, Baltimore, MY: ACM Press, pp.427–437.
30. Pointcheval, D. and Stern, J. (2000) ‘Security arguments for digital signatures and blind signatures’, Journal of Cryptology, Vol. 13, No. 3, pp.361–396.
31. Rackoff, C. and Simon, D.R. (1992) ‘Non-interactive zero knowledge proof of knowledge and chosen ciphertext attack’, in J. Feigenbaum (Ed). Advances in Cryptology-CRYPTO’91, Vol. 576, Lecture Notes in Computer Science, International Association for Cryptologic Research, Berlin Germany: Springer-Verlag, pp.433–444.
32. Sahai, A. (1999) ‘Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. in IEEE P. Beame (Ed). 40th Annual Symposium on Foundations of Computer Science, 17–19 Ocotber, New York, IEEE Computer Society Press, pp.543–553.
33. Tsiounis, Y. and Yung, M. (1998) ‘On the security of ElGamal based encryption’, H. Imai and Y. Zheng (Eds). Proceedings of the First International Public Key Cryptography Conference, Lecture Notes in Computer Science, pp.117–134.