CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Broadcast Encryption's Bright Future
Computer
Revocation and Tracing Schemes for Stateless Receivers
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Key Establishment in Large Dynamic Groups Using One-Way Function Trees
IEEE Transactions on Software Engineering
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)
Chinese remainder theorem based group key management
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
A Conference Key Distribution Scheme Using Interpolating Polynomials
MUE '07 Proceedings of the 2007 International Conference on Multimedia and Ubiquitous Engineering
Dynamic Balanced Key Tree Management for Secure Multicast Communications
IEEE Transactions on Computers
Computation-Efficient Multicast Key Distribution
IEEE Transactions on Parallel and Distributed Systems
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Secure multiple group ownership transfer protocol for mobile RFID
Electronic Commerce Research and Applications
| Hi-index | 0.00 |
A group key distribution scheme based on static key tree structure and the Chinese Remainder Theorem (KTCRT-GKD) is proposed. It deal with the scenario of a pre-defined static prospective user set U containing all potential customs of multicast services and concentrate on the stateless receiver case. Given a privileged group member set G *** U consisting of authorized users in a multicast session, a set of subtrees of the user tree whose leaves just host all the privileged group members is called group member subtrees. We design an algorithm to compute the root IDs of group member subtrees. The key server uses the root keys of the group member subtrees and the Chinese Remainder Theorem to distribute a group key. It can reduce the key server's computation complexity for each group key distribution. Especially, an interesting feature is that, when the size of group members exceeds a certain number, the computing time of the key server will decrease with the increase of the size of the group members.