The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - July-September (2007 vol.4)
pp: 228-242
Wei Yu , Microsoft Corp., Redmond
ABSTRACT
Although a 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 costs. 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 the two-party Diffie-Hellman (DH) upon any single-user join event and O(log n) rounds of the two-party DH upon any single-user leave event. Both the theoretical bound analysis and simulation show that the proposed scheme achieves a lower rekeying cost than the existing tree-based contributory group key agreement schemes.
INDEX TERMS
groupware, authorisation, cryptographic protocols,contributory group key agreement, two-party Diffie-Hellman protocol, phantom user position, PFMH, logical key tree structure, dynamic group applications, collaborative group applications, access control,Cost function, DH-HEMTs, Access control, Protocols, Tree data structures, Collaboration, Mobile communication, Sun, Computational efficiency, Imaging phantoms,Tree Structure, Security, Key Management
CITATION
Wei Yu, Yan Sun, K.J.R. 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-September 2007, doi:10.1109/TDSC.2007.1006
49 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool