Optimal tree structures for group key tree management considering insertion and deletion cost

DOI10.1016/j.tcs.2009.02.039zbMath1172.68015OpenAlexW2025982679MaRDI QIDQ1029331

Weiwei Wu, Minming Li, Enhong Chen

Publication date: 10 July 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.02.039

zbMATH Keywords

optimalityupdating costgroup keyskey trees

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Optimal Trees for Minimizing Average Individual Updating Cost ⋮ Optimal trees for minimizing average individual updating cost ⋮ Optimal tree structure with loyal users and batch updates ⋮ Group rekeying in the exclusive subset-cover framework

Cites Work

• Unnamed Item
• A lower bound for multicast key distribution
• Optimizing deletion cost for secure multicast key management
• Optimal Tree Structures for Group Key Management with Batch Updates
• Advances in Cryptology – CRYPTO 2004
• Approximately Optimal Trees for Group Key Management with Batch Updates

This page was built for publication: Optimal tree structures for group key tree management considering insertion and deletion cost