Cryptographic key assignment scheme for access control in a hierarchy
Information Systems
A New Public-Key Cipher System Based Upon the Diophantine Equations
IEEE Transactions on Computers
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)
Cryptographic solution to a problem of access control in a hierarchy
ACM Transactions on Computer Systems (TOCS)
Efficient and secure keys management for wireless mobile communications
Proceedings of the second ACM international workshop on Principles of mobile computing
Secure multicast in wireless networks of mobile hosts: protocols and issues
Mobile Networks and Applications
Comparison of inter-area rekeying algorithms for secure wireless group communications
Performance Evaluation
A Time-Bound Cryptographic Key Assignment Scheme for Access Control in a Hierarchy
IEEE Transactions on Knowledge and Data Engineering
Hydra: A Decentralised Group Key Management
WETICE '02 Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises
Secure and Scalable Inter-Domain Group Key Management for N-to-N Multicast
ICPADS '98 Proceedings of the 1998 International Conference on Parallel and Distributed Systems
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
A survey of key management for secure group communication
ACM Computing Surveys (CSUR)
Protocol design for scalable and reliable group rekeying
IEEE/ACM Transactions on Networking (TON)
Secret Sharing with Access Structures in a Hierarchy
AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2
Efficient communication-storage tradeoffs for multicast encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Research: Dynamic key management schemes for access control in a hierarchy
Computer Communications
Research note: Comments on `dynamic key management schemes for access control in a hierarchy'
Computer Communications
Research note: A conference key distribution scheme based on the theory of quadratic residues
Computer Communications
Secure multicast in IPTV services
Computer Networks: The International Journal of Computer and Telecommunications Networking
Key management with host mobility in dynamic groups
Proceedings of the 3rd international conference on Security of information and networks
On performance of group key distribution techniques when applied to IPTV services
Computer Communications
Secure group re-keying using key inverses
Journal of High Speed Networks
Hi-index | 0.00 |
The proliferation of the Internet computing and mobile computing technologies gives rise to the growth of mobile Internet applications. There are increasing demands on secure multicast services in the mobile Internet environment. An important issue in secure group communication is key management, which is concerned with distributing and updating the keys for encrypting the multicast messages in a group of mobile users. The challenges in designing secure and scalable key management protocols are dynamic updates of the key caused by frequent moves, joining and leaving of group members and the large size of a group for mobile Internet applications. In this paper, we propose a scalable and hierarchical key management (SHKM) protocol in the mobile Internet. In order to address the scalability issue, SHKM divides the group of users into different subgroups, where each subgroup uses its own key. Different from existing decentralized schemes, the subgroups in the SHKM protocol are organized into a hierarchical structure with different priorities. Each pair of parent-child subgroups is given a related factor based on their subgroup keys. The trusted third-party authority is responsible for computing the parameters. Based on these and some public parameters, users belonging to a higher-priority subgroup have the right and are capable to deduce the keys of lower-priority subgroups but the reverse operation is not allowed. Because the subgroup itself can perform the derivation, the number of re-keying messages for updating the global key management system across the subgroup boundaries can be significantly reduced. We compare the proposed protocol with some existing protocols, and conclude that the number of re-keying messages in our proposed protocol is the least among all these protocols.