Optimal Tree Structures for Group Key Management with Batch Updates
From MaRDI portal
Recommendations
- Approximately Optimal Trees for Group Key Management with Batch Updates
- Approximately optimal trees for group key management with batch updates
- Optimal trees for minimizing average individual updating cost
- Optimal tree structure with loyal users and batch updates
- Optimal trees for minimizing average individual updating cost
Cited in
(13)- Approximately optimal trees for group key management with batch updates
- Optimal tree structures for group key tree management considering insertion and deletion cost
- Relaxed multi-way trees with group updates.
- Relaxed red-black trees with group updates
- A DC programming approach for solving a centralized group key management problem
- Grafting key trees: efficient key management for overlapping groups
- Optimal trees for minimizing average individual updating cost
- On the average number of ciphertexts for the optimal key-management tree for a frequency distribution of communication
- Optimal key tree structure for two-user replacement and deletion problems
- Optimal tree structure with loyal users and batch updates
- Approximately Optimal Trees for Group Key Management with Batch Updates
- Optimal trees for minimizing average individual updating cost
- Optimizing deletion cost for secure multicast key management
This page was built for publication: Optimal Tree Structures 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 Q3503233)
