An information-theoretic approach for design and analysis of rooted-tree-based multicast key management schemes

DOI10.1109/18.959263zbMath1019.94016OpenAlexW2102881640MaRDI QIDQ4544726

John S. Baras, Radha Poovendran

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.959263

zbMATH Keywords

entropycollusionmulticast securitymember deletionrooted-tree-based multicast key distribution

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Measures of information, entropy (94A17)

Related Items (3)

Multi-seed key distribution scheme test ⋮ Centralized key distribution protocol using the greatest common divisor method ⋮ Approximation Algorithms for Key Management in Secure Multicast

This page was built for publication: An information-theoretic approach for design and analysis of rooted-tree-based multicast key management schemes