Dynamic join-exit amortization and scheduling for time-efficient group key agreement

We propose a time-efficient contributory key agreement framework for secure communications in dynamic groups. The proposed scheme employs a special join-tree/exit-tree topology in the logical key tree and effectively exploits the efficiency of amortized operations. We derive the optimal parameters a...

Full description

Saved in:
Bibliographic Details
Main Authors: Mao, Yinian, Sun, Yan, Wu, Min, Liu, K.J. Ray
Format: Conference Proceeding
Language:English
Subjects:
Access control
Applied sciences
Computational modeling
Cryptography
Data security
DH-HEMTs
Dynamic scheduling
Educational institutions
Exact sciences and technology
Information, signal and communications theory
Processor scheduling
Secret
Signal and communications theory
Sun
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Topology
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose a time-efficient contributory key agreement framework for secure communications in dynamic groups. The proposed scheme employs a special join-tree/exit-tree topology in the logical key tree and effectively exploits the efficiency of amortized operations. We derive the optimal parameters and design an activation algorithm for the join and exit trees. We also show that the asymptotic average time cost per user join and leave event is /spl theta/(log (log n)), where n is the group size. Our experiment results on both simulated user activities and the real MBone data have shown that the proposed scheme outperforms the existing tree-based schemes.
ISSN:0743-166X
2641-9874
DOI:10.1109/INFCOM.2004.1354681