On sharing secrets and Reed-Solomon codes
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Peer-to-Peer Membership Management for Gossip-Based Protocols
IEEE Transactions on Computers
Practical Cryptography
Epidemic-Style Proactive Aggregation in Large Overlay Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Decentralized Schemes for Size Estimation in Large and Dynamic Groups
NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
Trusted Computing: Providing Security for Peer-to-Peer Networks
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Challenges for Trusted Computing
IEEE Security and Privacy
A universal Reed-Solomon decoder
IBM Journal of Research and Development
A secure DVB set-top box via trusting computing technologies
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
EKM: an efficient key management scheme for large-scale peer-to-peer media streaming
PCM'06 Proceedings of the 7th Pacific Rim conference on Advances in Multimedia Information Processing
Efficient key distribution schemes for secure media delivery in pay-TV systems
IEEE Transactions on Multimedia
On key distribution management for conditional access system on pay-TV system
IEEE Transactions on Consumer Electronics
A scalable key distribution scheme for conditional access system in digital pay-TV system
IEEE Transactions on Consumer Electronics
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
Key distribution for multimedia live streaming peer-to-peer overlay networks is a field still in its childhood stage. A scheme designed for networks of this kind must seek security and efficiency while keeping in mind the following restrictions: limited bandwidth, continuous playing, great audience size and clients churn. This paper introduces two novel schemes that allow a trade-off between security and efficiency by allowing to dynamically vary the number of levels used in the key hierarchy. These changes are motivated by great variations in audience size, and initiated by decision of the Key Server. Additionally, a comparative study of both is presented, focusing on security and audience size. Results show that larger key hierarchies can supply bigger audiences, but offer less security against statistical attacks. The opposite happens for shorter key hierarchies.