KSII Transactions on Internet and Information Systems (TIIS)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

Secure and Efficient Tree-based Group Diffie-Hellman Protocol

  • Published : 2009.04.25
Download PDF
⟨ Previous Next ⟩

Abstract

Current group key agreement protocols(often tree-based) involve unnecessary delays because members with low-performance computer systems can join group key computation. These delays are caused by the computations needed to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of filtering low performance members in group key generation. This paper presents an efficient tree-based group key agreement protocol and the results of its performance evaluation. The proposed approach to filtering of low performance members in group key generation is scalable and it requires less computational overhead than conventional tree-based protocols.

Keywords

References

  1. Y. Kim, A. Perrig, and G. Tsudik, “Tree-based Group Key Agreement,” ACM Transaction on Information and System Security, ACM Press, 2004.
  2. E. Bresson, O. Chevassut, et al., “Provably authenticated group Diffie-Hellman key exchange,” in Proceedings of the 8th ACM conference on Computer and Communications Security, Philadelphia, PA, 2001.
  3. W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, vol. 22, pp.644-654, 1976. https://doi.org/10.1109/TIT.1976.1055638
  4. Y. Kim, “Group Key Agreement: Theory and Practice,” Ph.D. thesis, Dept. of Computer Science, University of Southern California at LA, 2002.
  5. E. Cole, R. K. Krutz, et al., “Network Security Bible,” John Wiley & Sons, 2005.
  6. A. K. Lenstra and E. R. Verheul, "Selecting cryptographic key sizes,” Journal of Cryptology, vol. 14, no. 4, pp.255-293, 2001.
  7. Y. Amir and J. Stanton, “The Spread wide area group communication system,” Center of Networking and Distributed Systems: Tech. Rep. 98-4, Johns Hopkins University, 1998.
  8. A. L. N. Fekete and A. Shvartsman, “Specifying and using a partionable group communication service,” In ACM PODC ’97, Santa Barbara, CA, 1997.
  9. M. Burmester and Y. Desmedt, “A secure and efficient conference key distribution system,” Advances in Cryptology - EUROCRYPT’94, 1994.
  10. Y. Kim, A. Perrig, and G. Tsudik, “Communication-efficient group key agreement,” in 17th International Information Security Conference, 2001.
  11. 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, vol. 7, no. 3, pp.457- 488, 2004. https://doi.org/10.1145/1015040.1015045
  12. D. Wallner, E. Harder, et al., “Key management for multicast: Issues and architecture,” in MILCOM 98, 1998.
  13. Y. Kim, A. Perrig, et al., “Simple and fault-tolerant key agreement for dynamic collaborative groups,” in 7th ACM Conference on Computer and Communications Security, 2000.