Approximately optimal trees for group key management with batch updates

DOI10.1016/j.tcs.2008.10.034zbMath1162.68044OpenAlexW2096809840MaRDI QIDQ1007240

Ze Feng, Nan Zang, Minming Li, Ronald L. Graham, Frances F. Yao

Publication date: 20 March 2009

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

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

zbMATH Keywords

optimalityapproximation algorithmskey treeskey managementbatch update

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Approximation algorithms (68W25) Authentication, digital signatures and secret sharing (94A62)

Related Items

Optimal Trees for Minimizing Average Individual Updating Cost, Optimal trees for minimizing average individual updating cost, Group rekeying in the exclusive subset-cover framework

Cites Work

• Optimal Tree Structures for Group Key Management with Batch Updates
• Advances in Cryptology – CRYPTO 2004