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

DOI10.1016/J.TCS.2009.02.039MaRDI QIDQ1029331zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost
• Optimizing deletion cost for secure multicast key management
• Optimal key tree structure for two-user replacement and deletion problems
• Optimal Key Tree Structure for Deleting Two or More Leaves
• Optimal trees for minimizing average individual updating cost

Cites work

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

Cited in

(9)

• Optimal trees for minimizing average individual updating cost
• Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost
• Optimal key tree structure for two-user replacement and deletion problems
• Optimal trees for minimizing average individual updating cost
• Optimizing deletion cost for secure multicast key management
• Group rekeying in the exclusive subset-cover framework
• Optimal tree structure with loyal users and batch updates
• Solving a centralized dynamic group key management problem by an optimization approach
• Optimal Key Tree Structure for Deleting Two or More Leaves

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

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