Optimal tree structure with loyal users and batch updates

DOI10.1007/S10878-010-9312-ZzbMATH Open1236.90133OpenAlexW1972945010MaRDI QIDQ411208FDOQ411208

Authors: Yu-Ki Chan, Minming Li, Weiwei Wu 

Publication date: 4 April 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9312-z

Recommendations

• Optimal trees for minimizing average individual updating cost
• Optimal Tree Structures for Group Key Management with Batch Updates
• Optimal trees for minimizing average individual updating cost
• Optimal key tree structure for two-user replacement and deletion problems
• Approximately Optimal Trees for Group Key Management with Batch Updates

zbMATH Keywords

optimalityprobabilityupdating costgroup keyskey trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15)

Cites Work

• Optimal Tree Structures for Group Key Management with Batch Updates
• Optimal Key Tree Structure for Deleting Two or More Leaves
• Optimizing deletion cost for secure multicast key management
• A lower bound for multicast key distribution
• Optimal tree structures for group key tree management considering insertion and deletion cost

Cited In (4)

• Optimal Tree Structures for Group Key Management with Batch Updates
• Optimal trees for minimizing average individual updating cost
• Optimal key tree structure for two-user replacement and deletion problems
• Optimal trees for minimizing average individual updating cost

This page was built for publication: Optimal tree structure with loyal users and batch updates

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