Approximately optimal trees for group key management with batch updates

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

Minming Li, Ze Feng, Nan Zang, 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

optimality; approximation algorithms; key trees; key management; batch update

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

94A60: Cryptography

68P25: Data encryption (aspects in computer science)

68W25: Approximation algorithms

94A62: Authentication, digital signatures and secret sharing