Optimizing deletion cost for secure multicast key management

DOI10.1016/J.TCS.2008.03.016zbMath1252.94107OpenAlexW2164084389MaRDI QIDQ935143

Ze Feng, Zhi-Zhong Chen, Minming Li, Frances F. Yao

Publication date: 31 July 2008

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

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

zbMATH Keywords

securitydynamic optimizationkey tree

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Dynamic programming (90C39) Authentication, digital signatures and secret sharing (94A62)

Related Items (6)

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 ⋮ Group rekeying in the exclusive subset-cover framework ⋮ Optimal tree structures for group key tree management considering insertion and deletion cost

Cites Work

• A lower bound for multicast key distribution
• Algorithms for dynamic multicast key distribution trees
• Optimal Tree Structures for Group Key Management with Batch Updates
• Advances in Cryptology – CRYPTO 2004
• Approximately Optimal Trees for Group Key Management with Batch Updates

This page was built for publication: Optimizing deletion cost for secure multicast key management