Optimal key tree structure for two-user replacement and deletion problems

DOI10.1007/S10878-011-9431-1zbMath1298.90090OpenAlexW2150988524MaRDI QIDQ358638

Minming Li, Enhong Chen, Weiwei Wu

Publication date: 9 August 2013

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

Full work available at URL: https://doi.org/10.1007/s10878-011-9431-1

zbMATH Keywords

optimalitykey treemulticast costupdating costuser deletion

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (2)

Optimal Trees for Minimizing Average Individual Updating Cost ⋮ Optimal trees for minimizing average individual updating cost

Cites Work

• Optimal tree structure with loyal users and batch updates
• Optimizing deletion cost for secure multicast key management
• Optimal Tree Structures for Group Key Management with Batch Updates
• Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost
• Optimal Key Tree Structure for Deleting Two or More Leaves
• Advances in Cryptology – CRYPTO 2004
• Approximation Algorithms for Key Management in Secure Multicast

This page was built for publication: Optimal key tree structure for two-user replacement and deletion problems