Abstract
Group communication is the basis for many recent multimedia and web applications. The group key management is one of the most critical problems in a large dynamic group. All group rekeying protocols add communication as well as computational overhead at the Group Key Controller (GKC) and group members. The trade off between these overheads depends on different levels of security required for different types of multicast applications [10,12,16]. This proposed work introduces a new key management algorithm based on Chinese reminder theorem (CRT). This algorithm uses CRT tuple of smaller remainders instead of keys of larger bits. So, any computation on these keys is carried out in parallel using remainders. Thus this approach reduces overall computational overhead. This algorithm reduces communication over head during the join event highly without compromising security.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Wong, C.K., Gouda, M.G., Lam, S.: Secure group communications using key graphs. IEEE/ACM Trans. Networks, 16–30 (2000)
Wallner, D., Harder, E., Agee, R.: Key Management for Multicast: Issues and Architectures. In: RFC 2627 (1999)
Waldvogel, M., Caronni, G., Sun, D., Weiler, N., Plattner, B.: The VersaKey framework: Versatile group key management. IEEE Journal Selected Areas in Communications (Special Issue on Middleware), 1614–1631 (1999)
Perrig, A., Song, D., Tygar, J.D.: Elk: A new protocol for efficient large-group key distribution. In: Proceedings of the IEEE Symposium on Security and Privacy, Oakland, Calif. IEEE Computer Society Press, Los Alamitos (2001)
Harney, H., Muckenhirn, C.: Group Key Management Protocol (GKMP) Specification. In: RFC 2093 (1997)
Harney, H., Muckenhirn, C.: Group Key Management Protocol (GKMP) Architecture. In: RFC 2094 (1997)
Mittra, S.: Iolus: A framework for scalable secure multicasting. In: Proceedings of the ACM SIGCOMM, New York, vol. 27(4), pp. 277–288 (1997)
Briscoe, B.: Marks: Multicast key management using arbitrarily revealed key sequences. In: Proceedings of the 1st International Workshop on Networked Group communications, Pisa, Italy (1999)
Chang, I., Engel, R., Kandlur, D., Pendarakis, D., Saha, D.: Key management for secure internet multicast using Boolean function minimization technique. In: IEEE INFOCOM, New York, vol. 2, pp. 689–698 (1999)
Judge, P., Ammar, M.: Security Issues and Solutions in Multicast Content Distribution: A Survey. IEEE Network, 30–36 (2003)
Rafaeli, S., Hutchison, D.: A Survey of Key Management for Secure Group Communication. ACM Computing Surveys, 309–329 (2003)
Challal, Y., Bettahar, H., Bouabdallah, A.: SAKM: A Scalable and Adaptive Key Management Approach for Multicast Communications. ACM SIGCOMM Computer Communications Review 34, 55–70 (2004)
Canetti, R., Gacay, J., Itkis, G., Micciancio, D., Nao, M., Pinkas, B.: Multicast Security: A Taxonomy and Some Efficient Constructions. In: Proceedings of IEEE INFOCOM, New York, pp. 708–716 (1999)
Lee, F.Y., Shieh, S.: Scalable and Lightweight key distribution for secure group communications, International Journal of Network Management. Int. J. Network Mgmt 14, 167–176 (2004)
Xs, L., Yr, Y., Mg, G., Ss, L.: Batch rekeying for secure group communications. In: Proceedings of 10th International Conference World Wide Web, pp. 525–534 (2001)
Horng, G.: Cryptanalysis of a Key Management Scheme for secure Multicast Communications. IEICE Trans Commun. E85-B(5), 1050–1051 (2002)
Ku, W.C., Chen, S.M.: An Improved Key Management Scheme for Large Dynamic Groups Using One-Way Function Trees. In: Proc. ICPPW 2003, pp. 391–396 (2003)
Canetti, R., Garey, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Multicast security: A taxonomy and efficient constructions. In: Proc. IEEE Infocomm 1999, vol. 2, pp. 708–716 (1999)
Rafaeli, S., Mathy, L., Hutchinson, D.: LKH+2: An improvement on the LKH+ algorithm for removal operations. Internet Draft, draft-rafaeli-lkh2-oo.txt (2002)
Sherman, A.T., McGrew, D.A.: Key Establishment in Large Dynamic Groups Using One-Way Function Trees. IEEE transaction on software engineering 29(5) (2003)
Setia, S., Koussih, S., Jajodia, S.: Kronos: A Scalable group re-keying approach for secure multicast. In: Proceedings of the IEEE Symposium on Security and Privacy, Oakland Calif. IEEE Computer Society Press, Los Alamitos (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Varthini, B.P., Valli, S. (2005). An Enhanced One Way Function Tree Rekey Protocol Based on Chinese Remainder Theorem. In: Yolum, p., Güngör, T., Gürgen, F., Özturan, C. (eds) Computer and Information Sciences - ISCIS 2005. ISCIS 2005. Lecture Notes in Computer Science, vol 3733. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11569596_6
Download citation
DOI: https://doi.org/10.1007/11569596_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29414-6
Online ISBN: 978-3-540-32085-2
eBook Packages: Computer ScienceComputer Science (R0)