Introduction to algorithms
Hardware Implementation of Montgomery's Modular Multiplication Algorithm
IEEE Transactions on Computers
Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Iolus: a framework for scalable secure multicasting
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Computer architecture (2nd ed.): a quantitative approach
Computer architecture (2nd ed.): a quantitative approach
Communication complexity of group key distribution
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Scalable multicast security in dynamic groups
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Simple and fault-tolerant key agreement for dynamic collaborative groups
Proceedings of the 7th ACM conference on Computer and communications security
Multicasting on the Internet and Its Applications
Multicasting on the Internet and Its Applications
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
DISEC: A Distributed Framework for Scalable Secure Many-to-Many Communication
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
CLIQUES: A New Approach to Group Key Agreement
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Performance Optimizations for Group Key Management Schemes
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
ELK, a New Protocol for Efficient Large-Group Key Distribution
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
A scalable multicast key management scheme for heterogeneous wireless networks
IEEE/ACM Transactions on Networking (TON)
Resource-aware conference key establishment for heterogeneous networks
IEEE/ACM Transactions on Networking (TON)
Multicast group behavior in the Internet's multicast backbone (MBone)
IEEE Communications Magazine
The VersaKey framework: versatile group key management
IEEE Journal on Selected Areas in Communications
Scalable secure group communication over IP multicast
IEEE Journal on Selected Areas in Communications
A survey of security issues in multicast communications
IEEE Network: The Magazine of Global Internetworking
Minimizing Eavesdropping Risk by Transmission Power Control in Multihop Wireless Networks
IEEE Transactions on Computers
Optimizing Rekeying Cost for Contributory Group Key Agreement Schemes
IEEE Transactions on Dependable and Secure Computing
Hierarchical group access control for secure multicast communications
IEEE/ACM Transactions on Networking (TON)
An efficient key management scheme for live streaming
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
DAKS: an efficient batch rekeying scheme for departure-aware multicast services
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Optimizing the batch mode of group rekeying: lower bound and new protocols
INFOCOM'10 Proceedings of the 29th conference on Information communications
Bridging broadcast encryption and group key agreement
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Fast transmission to remote cooperative groups: a new key management paradigm
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
In secure group communications, the time cost associated with key updates in the events of member join and departure is an important aspect of quality of service, especially in large groups with highly dynamic membership. To achieve better time efficiency, we propose a join-exit-tree (JET) key management framework. First, a special key tree topology with join and exit subtrees is introduced to handle key updates for dynamic membership. Then, optimization techniques are employed to determine the capacities of join and exit subtrees for achieving the best time efficiency, and algorithms are designed to dynamically update the join and exit trees. We show that, on average, the asymptotic time cost for each member join/departure event is reduced to O(log (log n)) from the previous cost of O(log n), where n is the group size. Our experimental results based on simulated user activities as well as the real MBone data demonstrate that the proposed JET scheme can significantly improve the time efficiency, while maintaining low communication and computation cost, of tree-based contributory key management.