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

DOI10.1109/18.959263MaRDI QIDQ4544726zbMATH OpenOpenAlexFDO

Authors Radha Poovendran, John S. Baras

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

collusionentropymember deletionmulticast securityrooted-tree-based multicast key distribution

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1418321
• scientific article; zbMATH DE number 2080178
• scientific article; zbMATH DE number 1930760
• RESILIENT LKH: SECURE MULTICAST KEY DISTRIBUTION SCHEMES
• A lower bound for multicast key distribution

Cited in

(6)

• Centralized key distribution protocol using the greatest common divisor method
• scientific article; zbMATH DE number 5811791 (Why is no real title available?)
• Multi-seed key distribution scheme test
• scientific article; zbMATH DE number 1930760 (Why is no real title available?)
• scientific article; zbMATH DE number 1418321 (Why is no real title available?)
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544726)