A lower bound for multicast key distribution

DOI10.1016/J.COMNET.2004.09.001MaRDI QIDQ707165zbMATH OpenOpenAlexWikidataFDO

Authors Subhash Suri, George Varghese, Jack Snoeyink

Publication date 9 February 2005

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.2460

zbMATH Keywords

MulticastProtocol analysisSecurity

Mathematics Subject Classification ID

Network protocols (68M12)

Recommendations

• Advances in Cryptology - EUROCRYPT 2004
• Algorithms for dynamic multicast key distribution
• Approximation Algorithms for Key Management in Secure Multicast
• Algorithms for dynamic multicast key distribution trees
• scientific article; zbMATH DE number 1304090

Cited in

(12)

• Optimal tree structures for group key tree management considering insertion and deletion cost
• Optimal trees for minimizing average individual updating cost
• Algorithms for dynamic multicast key distribution trees
• On optimal cryptographic key derivation
• Optimal tree structure with loyal users and batch updates
• scientific article; zbMATH DE number 1304090 (Why is no real title available?)
• scientific article; zbMATH DE number 2048534 (Why is no real title available?)
• An information-theoretic approach for design and analysis of rooted-tree-based multicast key management schemes
• Advances in Cryptology - EUROCRYPT 2004
• Approximation Algorithms for Key Management in Secure Multicast
• Minimizing center key storage in hybrid one-way function based group key management with communication constraints
• Optimizing deletion cost for secure multicast key management

This page was built for publication: A lower bound for multicast key distribution

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