Paper Info
Title
Optimizing Rekeying Cost for Contributory Group Key Agreement Schemes
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.
Year
DOI
Venue
2007
10.1109/TDSC.2007.1006
IEEE Trans. Dependable Sec. Comput.
Keywords
Field
DocType
logical key tree structure,dynamic group application,collaborative group applications,contributory group key agreement,key agreement scheme,key management,pfmh,two-party dh,tree structure,phantom user position,proposed scheme,authorisation,single user leave event,cryptographic protocols,rekeying cost,dynamic group applications,existing tree-based contributory group,groupware,single user,security,two-party diffie-hellman protocol,access control,novel logical key tree,lower bound,mobile communication,cost function,sun,protocols,materials,tree data structures,collaboration
Group key,Key management,Cryptographic protocol,Upper and lower bounds,Computer science,Tree (data structure),Rekeying,Tree structure,Access control,Distributed computing
Journal
Volume
Issue
ISSN
4
3
1545-5971
Citations 
PageRank 
References 
16
0.65
25
Authors
3
Name
Order
Citations
PageRank
Wei Yu112519.50
Yan (Lindsay) Sun2544.02
K. J. Ray Liu310390743.86