| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
 Digg
 Furl
 Spurl
 Blink
 Simpy
 Google
 Del.icio.us
 Y!MyWeb
| |
| | Search | |
| |
| |
| | |
Optimizing Rekeying Cost for Contributory Group Key Agreement Schemes
July-September 2007 (vol. 4 no. 3)
pp. 228-242
While contributory group key agreement is a promising solution to achieve access control in collaborative and dynamic group applications, the existing schemes have not achieved the performance lower bound in terms of time, communication and computation cost. In this paper we propose a contributory group key agreement that achieves the performance lower bound by utilizing a novel logical key tree structure, called PFMH, and the concept of phantom user position. In particular, the proposed scheme only needs O(1) rounds of two-party DH upon any single user join event and O(log n) rounds of two-party DH upon any single user leave event. Both theoretical bound analysis and simulation show that the proposed scheme achieves lower rekeying cost than the existing tree-based contributory group key agreement schemes.
[1] 228 I. Ingemarsson, D.T. Tang, and C.K. Wong, “A Conference on Key Distribution System,” IEEE Trans. Information Theory, vol. 28, no. 5, pp. 714-720, Sept. 1982.[2] D.G. Steer, L. Strawczynski, W. Diffie, and M. Wiener, “A Secure Audio Teleconference System,” Proc. Advances in Cryptology, pp.520-528, 1990.[3] M. Burmester and Y. Desmedt, “A Secure and Efficient Conference Key Distribution Scheme,” Advances in Cryptology—Proc. Workshop Theory and Application of Cryptographic Techniques (EUROCRYPT '94), pp. 275-286, 1994.[4] 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.[5] K. Becker and U. Wille, “Communication Complexity of Group Key Distribution,” Proc. Fifth ACM Conf. Computer and Comm. Security (CCS '98), pp. 1-6, 1998.[6] G. Ateniese, M. Steiner, and G. Tsudik, “Authenticated Group Key Agreement and Friends,” Proc. Fifth ACM Conf. Computer and Comm. Security (CCS '98), pp. 17-26, 1998.[7] M. Steiner, G. Tsudik, and M. Waidner, “Key Agreement in Dynamic Peer Groups,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 8, pp. 769-780, Aug. 2000.[8] Y. Kim, A. Perrig, and G. Tsukid, “Simple and Fault-Tolerant Key Agreement for Dynamic Collaborative Groups,” Proc. Seventh ACM Conf. Computer and Comm. Security (CCS '00), May 2000.[9] 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.[10] Y. Mao, Y. Sun, M. Wu, and K.J.R. Liu, “Dynamic Join-Exit Amortization and Scheduling for Time-Efficient Group Key Agreement,” Proc. INFOCOM '04, 2004.[11] Y. Amir, Y. Kim, C. Nita-Rotaru, J.L. Schultz, J. Stanton, and G. Tsudik, “Secure Group Communication Using Robust Contributory Key Agreement,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 5, pp. 468-480, May 2004.[12] G.H. Chiou and W.T. Chen, “Secure Broadcasting Using the Secure Lock,” IEEE Trans. Software Eng., vol. 15, pp. 929-934, Aug. 1989.[13] S. Mittra, “Iolus: A Framework for Scalable Secure Multicasting,” Proc. ACM Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm. (SIGCOMM '97), pp. 277-288, 1997.[14] C.K. Wong, M. Gouda, and S.S. Lam, “Secure Group Communications Using Key Graphs,” Proc. ACM Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm. (SIGCOMM '98), Sept. 1998.[15] D.M. Wallner, E.J. Harder, and R.C. Agee, Key Management for Multicast: Issues and Architectures, Internet draft, work in progress, Sept. 1998.[16] M.J. Moyer, J.R. Rao, and P. Rohatgi, “A Survey of Security Issues in Multicast Communications,” IEEE Network, vol. 13, no. 6, pp.12-23, Nov./Dec. 1999.[17] 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.[18] L.R. Dondeti, S. Mukherjee, and A. Samal, “DISEC: A Distributed Framework for Scalable Secure Many-to-Many Communication,” Proc. Fifth IEEE Symp. Computers and Comm. (ISCC '00), pp. 693-698, 2000.[19] A. Perrig, D. Song, and D. Tygar, “ELK, A New Protocol for Efficient Large-Group Key Distribution,” Proc. IEEE Symp. Security and Privacy, pp. 247-262, 2001.[20] 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.[21] W. Diffie and M. Hellman, “New Directions in Cryptography,” IEEE Trans. Information Theory, vol. IT-22, no. 6, pp. 644-654, Nov. 1976.[22] J. Snoeyink, S. Suri, and G. Varghese, “A Lower Bound for Multicast Key Distribution,” Proc. INFOCOM '01, 2001.[23] M. Bellare and P. Rogaway, “Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols,” Proc. First ACM Conf. Computer and Comm. Security (CCS '93), 1993.[24] K.C. Almeroth and M.H. Ammar, “Multicast Group Behavior in the Internet's Multicast Backbone (mbone),” IEEE Comm. Magazine, pp. 124-129, June 1977.[25] K.C. Almeroth, “A Long-Term Analysis of Growth and Usage Patterns in the Multicast Backbone (mbone),” Proc. INFOCOM '00, vol. 2, pp. 824-833, Mar. 2000.[26] Y. Mao, Y. Sun, M. Wu, and K.J.R. Liu, “JET: Dynamic Join-Exit-Tree Amortization and Scheduling for Contributory Key Management,” IEEE/ACM Trans. Networking, vol 14, no 5, pp.1128-1140, Oct. 2006.[27] W. Trappe, Y. Wang, and K.J.R. Liu, “Resource-Aware Conference Key Establishment for Heterogeneous Networks,” IEEE/ACM Trans. Networking, vol 13, no 1, pp.134-146, Feb. 2005.
Index Terms:
Security, Key Management, Tree Structure
Citation:
Wei Yu, Yan (Lindsay) Sun, K. J. Ray Liu, "Optimizing Rekeying Cost for Contributory Group Key Agreement Schemes," IEEE Transactions on Dependable and Secure Computing, vol. 4, no. 3, pp. 228-242, July-Sept. 2007, doi:10.1109/TDSC.2007.1006
