Secure group communications using key graphs
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Simple and fault-tolerant key agreement for dynamic collaborative groups
Proceedings of the 7th ACM conference on Computer and communications security
Batch rekeying for secure group communications
Proceedings of the 10th international conference on World Wide Web
A survey of key management for secure group communication
ACM Computing Surveys (CSUR)
The VersaKey framework: versatile group key management
IEEE Journal on Selected Areas in Communications
Security weakness in a three-party pairing-based protocol for password authenticated key exchange
Information Sciences: an International Journal
A function-based user authority delegation model
Information Sciences: an International Journal
Reliable Key Management and Data Delivery Method in Multicast Over Wireless IPv6 Networks
Wireless Personal Communications: An International Journal
Secure group re-keying using key inverses
Journal of High Speed Networks
Hi-index | 0.07 |
With the continuously emerging of Internet applications based on secure group communication, the design of secure group communication becomes an important Internet design topic. Group key management is important for secure group communication. Previous work focuses on key tree, which is an important type of key graphs. In this paper, we first propose another type of key graph-key link-tree, which shows better performance than key tree in single rekeying. Considering that the adoption of key link-tree results in worse than key tree in batch rekey, we propose two transform algorithms between key tree and key link-tree, which can get better rekey performance.