A lower bound for multicast key distribution
From MaRDI portal
Publication:707165
DOI10.1016/j.comnet.2004.09.001zbMath1093.68541OpenAlexW1668795879WikidataQ56970515 ScholiaQ56970515MaRDI QIDQ707165
Subhash Suri, George Varghese, Jack Scott 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
Related Items (7)
Minimizing center key storage in hybrid one-way function based group key management with communication constraints ⋮ Approximation Algorithms for Key Management in Secure Multicast ⋮ Optimal Trees for Minimizing Average Individual Updating Cost ⋮ On optimal cryptographic key derivation ⋮ Optimal tree structure with loyal users and batch updates ⋮ Optimizing deletion cost for secure multicast key management ⋮ Optimal tree structures for group key tree management considering insertion and deletion cost
This page was built for publication: A lower bound for multicast key distribution
