Optimal trees for minimizing average individual updating cost

DOI10.1016/J.TCS.2015.08.030zbMath1333.94057OpenAlexW2178397919MaRDI QIDQ896107

Sicen Guo, Minming Li, Yingchao Zhao

Publication date: 11 December 2015

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

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

zbMATH Keywords

optimalityaverage casekey 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
• 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