Secure Broadcasting Using the Secure Lock
IEEE Transactions on Software Engineering
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
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
ELK, a New Protocol for Efficient Large-Group Key Distribution
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
A survey of key management for secure group communication
ACM Computing Surveys (CSUR)
Key distribution for secure multimedia multicasts via data embedding
ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03
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
Wireless telemedicine and m-health: technologies, applications and research issues
International Journal of Sensor Networks
The effect of leaders on the consistency of group behaviour
International Journal of Sensor Networks
Security and Communication Networks
A review of GENI authentication and access control mechanisms
International Journal of Security and Networks
Hi-index | 0.00 |
Hierarchical access control for group communication providesaccess control which can assure that group members can subscribedifferent data streams or possibly multiples of them in amultimedia network. In this paper, to efficiently and effectivelyachieve this goal, we propose a Distributed Key Management Scheme(DKMS) whereby each Service Group (SG) maintains a SG server andgive detailed analysis. In the proposed scheme, the server for a SGis utilised to manage the key tree and provide the related sessionkeys for all the users in this SG. Detailed analysis is providedand we show that the communication overhead can be greatly reducedby O(n0 logd n0), wheren0 is the number of users in a SG, compared withemploying an integrated key graph to the hierarchical accesscontrol problem. At the same time, the storage overhead for allusers can be reduced by O(N), where N is the total number ofusers.