CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Generalized Beimal-Chor schemes for broadcast encryption and interactive key distribution
Theoretical Computer Science
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Key management for restricted multicast using broadcast encryption
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
This paper aims at reducing the computation and communication costs of service providers who own many channels. This is achieved by using a set of keys for the whole system instead of the earlier methods where different key structures are maintained for each of the programme2 hosted by the service provider. A tree structure approach proposed in this paper can be effectively used for key allocation, which uses only log2K keys for a K user domain irrespective of the number of programmes subscribed by them. With this tree based allocation the subscribers may be accommodated anywhere in the tree. Then for broadcasting every programme/channel a greedy algorithm is applied for finding the minimum number of nodes to cover all the members of the targetset. This system allows some of the nonpaying customers to view the programmes at free of cost. However the number of such non-paying customers can be limited according to the service provider's business motive in order to attract more customers by changing the parameter called redundancy. Public key cryptography is used for restricted multicast. This scheme also adapts for the dynamic environment where new customers may sign in and existing members may leave without modifying the keys-already allotted to the customers.