Optimal Tree Structures for Group Key Management with Batch Updates

DOI10.1137/06064929XzbMath1139.05014OpenAlexW2166459336WikidataQ126246762 ScholiaQ126246762MaRDI QIDQ3503233

Minming Li, Frances F. Yao, Ronald L. Graham

Publication date: 22 May 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/06064929x

zbMATH Keywords

optimalitygroup keyskey treesbatch updates

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Graph algorithms (graph-theoretic aspects) (05C85) Authentication, digital signatures and secret sharing (94A62)

Related Items

Optimal key tree structure for two-user replacement and deletion problems, Optimal Trees for Minimizing Average Individual Updating Cost, Optimal trees for minimizing average individual updating cost, 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