The Community for Technology Leaders
RSS Icon
Issue No.01 - January-February (2011 vol.8)
pp: 58-73
Bezawada Bruhadeshwar , International Institute of Information Technology, Hyderabad
Sandeep S. Kulkarni , Michigan State University, East Lansing
In this paper, we focus on trade-offs between storage cost and rekeying cost for secure multicast. Membership in secure multicast groups is dynamic and requires multiple updates in a single time frame. We present a family of algorithms that provide a trade-off between the number of keys maintained by users and the time required for rekeying due to revocation of multiple users. We show that some well-known algorithms in the literature are members of this family. We show that algorithms in this family can be used to reduce the cost of rekeying by 43-79 percent when compared with previous solutions while keeping the number of keys manageable. We also describe a scheme to reduce the number of secrets further when revocations are periodic. Furthermore, we describe techniques to provide preferential treatment for long standing members of the group without affecting the performance of the algorithms. Using our techniques, as the group size increases, long standing members need to store smaller number of keys than short-lived members. This property is useful for adapting to the variable storage requirements of users in current day heterogeneous networks.
Secure multicast, hierarchical key management, rekeying and storage trade-offs, user requirements and capabilities, heterogeneous environments.
Bezawada Bruhadeshwar, Sandeep S. Kulkarni, "Balancing Revocation and Storage Trade-Offs in Secure Group Communication", IEEE Transactions on Dependable and Secure Computing, vol.8, no. 1, pp. 58-73, January-February 2011, doi:10.1109/TDSC.2009.27
[1] H. Harney and C. Muckenhirn, "Group Key Management Protocol (GKMP) Specification," RFC 2093, July 1997.
[2] D.M. Wallner, E.J. Harder, and R.C. Agee, "Key Management for Multicast: Issues and Architectures," RFC 2627, 1999.
[3] C.K. Wong, M.G. Gouda, and S.S. Lam, "Secure Group Communications Using Key Graphs," IEEE/ACM Trans. Networking, vol. 8, no. 1, pp. 16-30, Feb. 2000.
[4] S.S. Kulkarni and B. Bruhadeshwar, "Adaptive Rekeying for Secure Multicast," IEEE/IEICE Trans. Comm., special issue on comm., vol. E86-B, no. 10, pp. 2948-2956, Oct. 2003.
[5] D. McGrew and A. Sherman, "Key Establishment in Large Dynamic Groups Using One-Way Function Trees," IEEE Trans. Software Eng., vol. 29, no. 5, pp. 444-458, May 2003.
[6] S. Mittra, "Iolus: A Framework for Scalable Secure Multicasting," Proc. ACM SIGCOMM '97, pp. 277-288, 1997.
[7] M. Waldvogel, G. Caronni, D. Sun, N. Weiler, and B. Plattner, "The Versakey Framework: Versatile Group Key Management," IEEE J. Selected Areas in Comm., vol. 17, no. 9, pp. 1614-1631, Sept. 1999.
[8] M. Burmester and Y. Desmedt, "A Secure and Efficient Conference Key Distribution System," Proc. Advances in Cryptology— EUROCRYPT '94, pp. 275-286, 1994.
[9] M. Steiner, G. Tsudik, and M. Waidner, "Diffie-Hellman Key Distribution Extended to Group Communication," Proc. Third ACM Conf. Computer and Comm. Security (CCS '96), pp. 31-37, 1996.
[10] J. Katz and M. Yung, "Scalable Protocols for Authenticated Group Key Exchange," Proc. Advances in Cryptology—CRYPTO '03, pp. 110-125, 2003.
[11] Y. Kim, A. Perrig, and G. Tsudik, "Tree-Based Group Key Agreement," ACM Trans. Information and System Security, vol. 7, no. 1, pp. 60-96, Feb. 2004.
[12] M. Manulis, "Security-Focused Survey on Group Key Exchange Protocols," Report 2006/395, Cryptology ePrint Archive, http:/, 2006.
[13] I. Chang, R. Engel, D. Kandlur, D. Pendarakis, and D. Saha, "Key Management for Secure Internet Multicast Using Boolean Function Minimization Techniques," Proc. IEEE INFOCOMM '99, vol. 2, pp. 689-698, Mar. 1999.
[14] D. Bruschi and E. Rosti, "Secure Multicast in Wireless Networks of Mobile Hosts: Protocols and Issues," Mobile Networks and Applications, vol. 7, no. 6, pp. 503-511, 2002.
[15] S. Zhu, S. Setia, S. Xu, and S. Jajodia, "Gkmpan: An Efficient Group Rekeying Scheme for Secure Multicast in Ad-Hoc Networks," Proc. IEEE Mobiquitos '04, pp. 42-51, 2004.
[16] Y. Sun, W. Trappe, and K.J.R. Liu, "A Scalable Multicast Key Management Scheme for Heterogeneous Wireless Networks," IEEE/ACM Trans. Networking, vol. 12, no. 4, pp. 653-666, Aug. 2004.
[17] X.S. Li, Y.R. Yang, M. Gouda, and S.S. Lam, "Batch Updates of Key Trees," Proc. 10th Int'l World Wide Web Conf. (WWW10), May 2001.
[18] S. Setia, S. Koushish, and S. Jajodia, "Kronos: A Scalable Group Re-Keying Approach for Secure Multicast," Proc. IEEE Symp. Security and Privacy, pp. 215-228, 2000.
[19] W.H.D. Ng, M. Howarth, Z. Sun, and H. Cruickshank, "Dynamic Balanced Key Tree Management for Secure Multicast Communications," IEEE Trans. Computers, vol. 56, no. 5, pp. 577-589, May 2007.
[20] F. Zhu, A. Chan, and G. Noubir, "Optimal Tree Structure for Key Management of Simultaneous Join/Leave in Secure Multicast," Proc. Military Comm. Conf. (MILCOM), 2003.
[21] M.H. Heydari, L. Morales, and I.H. Sudborough, "Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast," Proc. 39th Ann. Hawaii Int'l Conf. System Sciences, vol. 9, 2006.
[22] H. Kurnio, S. Rei, and H. Wang, "Efficient Revocation Schemes for Secure Multicast," Proc. Int'l Conf. Information Security and Cryptology '01, pp. 160-177, Dec. 2001.
[23] M. Luby and J. Staddon, "Combinatorial Bounds for Broadcast Encryption," Proc. Advances in Cryptology—EUROCRYPT '98, pp. 512-526, 1998.
[24] A. Fiat and M. Naor, "Broadcast Encryption," Proc. Advances in Cryptology—CRYPTO '93, pp. 480-491, 1994.
[25] R. Poovendran and J.S. Baras, "An Information-Theoretic Approach for Design and Analysis of Rooted-Tree-Based Multicast Key Management Schemes," IEEE Trans. Information Theory, vol. 47, no. 7, pp. 2824-2834, Nov. 2001.
[26] C. Blundo and A. Cresti, "Space Requirements for Broadcast Encryption," Proc. Advances in Cryptology—EUROCRYPT, pp. 287-298, 1994.
[27] S. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, "Perfectly-Secure Key Distribution for Dynamic Conferences," Proc. Advances in Cryptology—CRYPTO '92, pp. 471-486, 1992.
[28] J.H. Cheon, N. Jho, M. Kim, and E. Yoo, "Skipping, Cascade, and Combined Chain Schemes for Broadcast Encryption," IEEE Trans. Information Theory, vol. 54, no. 11, pp. 5155-5171, Nov. 2008.
[29] Y.-H. Chu, S.G. Rao, S. Seshan, and H. Zhang, "A Case for End System Multicast," IEEE J. Selected Areas in Comm., vol. 20, no. 8, pp. 1456-1471, Oct. 2002.
[30] B. Zhang, S. Jamin, and L. Zhang, "Host Multicast: A Framework for Delivering Multicast to End Users," Proc. IEEE INFOCOM, Mar. 2000.
[31] J. Liebeherr, M. Nahas, and W. Si, "Application-Layer Multicasting with Delaunay Triangulation Overlays," IEEE J. Selected Areas in Comm., vol. 20, no. 8, pp. 1472-1488, Oct. 2002.
[32] L.M. Feeney and M. Nilsson, "Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment," Proc. IEEE INFOCOM, Apr. 2001.
75 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool