Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
Batch rekeying for secure group communications
Proceedings of the 10th international conference on World Wide Web
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable multicast key management scheme for heterogeneous wireless networks
IEEE/ACM Transactions on Networking (TON)
An analysis of live streaming workloads on the internet
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Introduction to Cryptography with Coding Theory (2nd Edition)
Introduction to Cryptography with Coding Theory (2nd Edition)
JET: dynamic join-exit-tree amortization and scheduling for contributory key management
IEEE/ACM Transactions on Networking (TON)
Multicast Key Management Scheme Based on TOFT
HPCC '08 Proceedings of the 2008 10th IEEE International Conference on High Performance Computing and Communications
A framework for a distributed key management scheme in heterogeneous wireless sensor networks
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
To protect multimedia content in live streaming applications, it is of critical importance to employ effective access control and key management schemes and to prevent unauthorized access. Many live streaming applications experience a large variation in the user number, high reconnection rate, and a large number of short sessions. Such frequent membership update may introduce significant rekey overhead and poses challenges to efficient key management. This paper considers applications that can tolerate a small amount of content leak, explores the unique characteristics of live broadcast streaming in membership dynamics, and investigates efficient key management mechanisms. Our proposed scheme uses the reconnection algorithm, batch rekeying and grouped user placement to reduce the communication and the computation cost associated with key update. Our analytical and simulation results show that the proposed scheme can reduce more than 50% of the rekey messages, and helps decrease the number of rekey messages that a user needs to decrypt by more than 90%.