Resisting traitors in linkable democratic group signatures

International Journal of Network Security

Volumn 9, Issue 1, 2009, Pages 51-60

  Ibrahim, Maged Hamada ^a  

^a HELWAN UNIVERSITY   (Egypt)

Author keywords

Democratic group signatures; Group signatures; Linkability; Threshold cryptography, zero knowledge proofs

Indexed keywords

CENTRALIZED MANAGEMENT; GROUP MANAGERS; GROUP MEMBERS; GROUP SIGNATURES; LINKABILITY; SECURITY IMPROVEMENT; SIGNER'S IDENTITY; ZERO KNOWLEDGE PROOF;

SAFETY ENGINEERING;

NETWORK SECURITY;

EID: 77953042205     PISSN: 1816353X     EISSN: 18163548     Source Type: Journal    
DOI: None     Document Type: Article

References (40)

1. D. Beaver, and J. B. Ilan, "Non-cryptographic faulttolerant computing in a constant number of rounds," Proceedings of the ACM Symposium on Principles of Distributed Computation, pp. 201-209, 1989.
2. D. Beaver, and S. Haber, "Cryptographic protocols provably secure against dynamic adversaries," Eurocypt '92, pp. 307-323, 1993.
3. M. Bellare, and P. Rogaway, "Random oracles are practical: A paradigm for designing efficient protocols," First ACM Conference on Computer and Communications Security, pp. 62-73, 1993.
4. A. Bender, J. Katz, and R. Morselli, "Ring signatures: Stronger definitions, and constructions without random oracles," Theory of Cryptography Conference, pp. 60-79, Springer-Verlag, 2006.
5. E. Berlekamp, and L. Welch, Error Correction for Algebraic Block Codes, US Patent 4,633,470.
6. J. Camenisch, and M. Stadler, "Efficient group signature schemes for large groups," Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology, LNCS 1294, pp. 410-424, Springer-Verlag, 1997.
7. J. Camenisch, and M. Michels. "A group signature scheme with improved efficiency," Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security, pp. 160-174, 1998.
8. J. Camenisch, and J. Groth, "Group signatures: Better efficiency and new theoretical aspects," SCN, LNCS 3352, pp. 120-133, Springer-Verlag, 2004.
9. R. Canetti, and R. Gennaro, "Incoercible multiparty computation," Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 504-513, 1996.
10. D. Chaum, and E. Heyst, "Group signatures," Advances in Cryptology - Eurocrypt '91, LNCS 547, pp. 257-265, Springer-Verlag, 1991.
11. E. D. Chaum, and T.P. Pedersen, "Wallet databases with observers," Advances in Cryptology - Crypto '92, pp. 89-105, 1992.
12. C. Dwork, M. Naor, R. Canetti, and R. Ostrovsky," Deniable encryption," Proceedings of the 17th Annual international Cryptology Conference on Advances in Cryptology, pp. 90-104, Springer-Verlag, London, 1997.
13. P. Feldman, "A practical scheme for non-interactive verifiable secret sharing," Proceeding 28th Annual Symposium on the Foundations of Computer Science, pp. 427-437, IEEE, 1987.
14. M. H. Ibrahim, "Eliminating quadratic slowdown in two-prime rsa function sharing," International Journal of Network Security (IJNS), vol. 7, no. 1, pp. 107-114, July 2008.
15. M. H. Ibrahim, Efficient Dealer-Less Threshold Sharing of Standard RSA, International Journal of Network Security (IJNS), to appear.
16. M. H. Ibrahim, A method for obtaining deniable public-key encryption, in the International Journal of Network Security (IJNS), to appear.
17. M. H. Ibrahim, "Receiver-deniable public-key encryption," The International Journal of Network Security (IJNS), to appear.
18. I. Ingemarsson, and G. J. Simmons, "A protocol to set up shared secret schemes without the assistance of a mutualy trusted party," Advances in Cryptology - Eurocrypt '91, LNCS 473, pp. 266-282, I. B. Damgard, Editor, Springer-Verlag, 1990.
19. J. Katz, and M. Yung, "Scalable protocols for authenticated group key exchange," Advances in Cryptology - Crypto '03, LNCS 2729, pp. 110-125, Springer-Verlag, 2003.
20. A. Kiayias, and M. Yung, "Group Signatures With efficient Concurrent Join," Advances in Cryptology - Eurocrypt '05, LNCS 3494, pp. 198-214, Springer- Verlag, 2005.
21. H. Krawczyk, R. Gennaro, S. Jarecki, and T. Rabin, "Robust threshold DSS signatures," Information and Computation, vol. 164, no. 1, pp. 54-84, 2001.
22. H. Krawczyk, R. Gennaro, S. Jarecki, and T. Rabin, "Secure distributed key generation for discrete-log based cryptosystems," Journal of Cryptology, vol. 20, no. 1, pp. 51-83, 2007.
23. A. Lysyanskaya, A. Sahai, R. L. Rivest, and S. Wolf, "Pseudonym systems," Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography, pp. 184-199, 2000.
24. M. Manulis, "Democratic group signatures - on an example of joint ventures," Proceedings of the ACM Symposium on Information, Computer and Communications Security (ASIACCS 2006), pp. 365-365, Taiwan, China, 2006.
25. M. Naor, O. Goldreich, R. Canetti, and U. Feige, "Adaptively secure multi-party computation," 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 639-648, 1996.
26. T. Pedersen, "Non-interactive and information theoretic secure verifiable secret sharing," Advances in Cryptology - Crypto '91, LNCS 576, pp. 129-140, J. Feigenbaum, Editor, Springer-Verlag, 1992.
27. A. Perrig, G. Tsudik, and Y. Kim, "Tree-based group key agreement," ACM Transactions on Information and System Security, vol. 7, no. 1, pp. 60-96, 2004.
28. C. N. Rotaru, G. Tsudik, Y. Amir, and Y. Kim, "On the performance of group key agreement protocols," ACM Transactions on Information and System Security, vol. 7, no. 3, pp. 457-488, 2004.
29. A. Sadeghi, J. Schwenk, and M. Manulis, "Linkable democratic group signatures," Proceedings of the 2nd Information Security Practice and Rexperience Conference (ISPEC 2006), pp. 11-14, China, 2006.
30. A. H. E. Sawy, I. A. Ali, I. I. Ibrahim, and M. H. Ibrahim, "Fast fully distributed and threshold rsa function sharing," Proceedings of Information Systems: New Generation Conference (ISNG 2004), pp. 11-15, Las Vegas, Nevada, USA, 2004.
31. A. H. E. Sawy, I. I. Ibrahim, and M. H. Ibrahim, "Fast three party shared generation of rsa keys without distributed primality test," Proceedings of Information Systems: New Generation Conference (ISNG 2004), pp. 5-10, Las Vegas, Nevada, USA, 2004. [32] B. Schoenmakers, Efficient Proofs of OR, Manuscript, 3 pages, 1993.
32. B. Schoenmakers, Efficient Proofs of OR, Manuscript, 3 pages, 1993.
33. A. Shamir, "How to share a secret," Communications of the ACM, vol. 22, pp. 612-613, 1979.
34. A. Shamir, R. L. Rivest, and Y. Tauman, "How to leak a secret," Asiacrypt 1, Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security, LNCS 2248, pp. 552-565, Springer-Verlag, 2001.
35. C. C. P. Schnorr, "Efficient signature generation by smart cards," Journal of Cryptology, vol. 4, no. 3, pp. 161-174, 1991.
36. C. Wang, J. M. Wing, and T. M. Wong, Verifiable Secret Redistribution for Threshold Sharing Schemes, Technical Report CMU-CS-02-114-R, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, Sep. 2002.
37. B. Warinschi, D. Micciancio, and M. Bellare, "Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions," Advances in Cryptology - Eurocrypt '03, LNCS 2656, pp. 614-629, Springer- Verlag, 2003.
38. A. Wigderson, M. B. Or, and S. Goldwasser, "Completeness theorems for noncryptographic faulttolerant distributed computations," Proceeding 20th Annual Symposium on the Theory of Computing, ACM, pp. 1-10, 1988.
39. D. S. Wong, J. K. Liu, and V. K. Wei, "Linkable spontaneous anonymous group signature for ad-hoc groups, "Information Security and Privacy, 9th Australasian Conference, ACISP 2004, LNCS 3108, pp. 325-335, Springer-Verlag, 2004.
40. C. Zhang, H. Shi, and M. Bellare, "Foundations of group signatures: The case of dynamic groups," CT-RSA, LNCS 2656, pp. 136-153, Springer-Verlag, 2005.