How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
How to construct random functions
Journal of the ACM (JACM)
Flexible access control with master keys
CRYPTO '89 Proceedings on Advances in cryptology
Secure group communications using key graphs
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
ID-based secret-key cryptography
ACM SIGOPS Operating Systems Review
Efficient Security for Large and Dynamic Multicast Groups
WETICE '98 Proceedings of the 7th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
Key derivation for network management applications
IEEE Network: The Magazine of Global Internetworking
Efficient multicast key management for stateless receivers
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
A key management scheme for secure group communication using binomial key trees
International Journal of Network Management
| Hi-index | 0.00 |
Proposals for key management of secure multicast that have been published so far are concentrated on reducing the complexity of communication for rekeying. If a group manager controls several multicast application groups and each of them involves a large number of members, it is important to maintain a set of secret keys as small as possible in order to reduce the group manager's storage for key management. In this paper, we propose a tree-based key management scheme, where the group manager can access keys by computing on the fly, without storing them. Using a concept of ID-based key generation and node bits on the tree, a storage for key management by the group manager can be greatly reduced.