Optimal Trees for Minimizing Average Individual Updating Cost

DOI10.1007/978-3-319-12691-3_28zbMath1333.94056OpenAlexW2122671957MaRDI QIDQ2942412

Yingchao Zhao, Sicen Guo, Minming Li

Publication date: 11 September 2015

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_28

zbMATH Keywords

optimalitykey treeindividual re-keying

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Optimal key tree structure for two-user replacement and deletion problems
• Optimal tree structure with loyal users and batch updates
• A lower bound for multicast key distribution
• Optimizing deletion cost for secure multicast key management
• Approximately optimal trees for group key management with batch updates
• Optimal tree structures for group key tree management considering insertion and deletion cost
• Optimal Tree Structures for Group Key Management with Batch Updates

This page was built for publication: Optimal Trees for Minimizing Average Individual Updating Cost