Approximately optimal trees for group key management with batch updates
DOI10.1016/J.TCS.2008.10.034zbMATH Open1162.68044OpenAlexW2096809840MaRDI QIDQ1007240FDOQ1007240
Authors: Minming Li, Ze Feng, Nan Zang, Ron 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
Recommendations
- Approximately Optimal Trees for Group Key Management with Batch Updates
- Optimal Tree Structures for Group Key Management with Batch Updates
- Grafting key trees: efficient key management for overlapping groups
- Optimal trees for minimizing average individual updating cost
- Approximation Algorithms for Key Management in Secure Multicast
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Approximation algorithms (68W25) Network design and communication in computer systems (68M10) Authentication, digital signatures and secret sharing (94A62)
Cites Work
Cited In (10)
- A DC programming approach for solving a centralized group key management problem
- Optimal Tree Structures for Group Key Management with Batch Updates
- Title not available (Why is that?)
- Optimal trees for minimizing average individual updating cost
- Grafting key trees: efficient key management for overlapping groups
- Approximately Optimal Trees for Group Key Management with Batch Updates
- Approximation Algorithms for Key Management in Secure Multicast
- Title not available (Why is that?)
- Optimal trees for minimizing average individual updating cost
- Group rekeying in the exclusive subset-cover framework
This page was built for publication: Approximately optimal trees for group key management with batch updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007240)
