Optimal key tree structure for two-user replacement and deletion problems
From MaRDI portal
Recommendations
- Optimal Key Tree Structure for Deleting Two or More Leaves
- Optimal trees for minimizing average individual updating cost
- Optimal trees for minimizing average individual updating cost
- Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost
- Optimal tree structures for group key tree management considering insertion and deletion cost
Cites work
- Advances in Cryptology – CRYPTO 2004
- Approximation Algorithms for Key Management in Secure Multicast
- Optimal Key Tree Structure for Deleting Two or More Leaves
- Optimal Tree Structures for Group Key Management with Batch Updates
- Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost
- Optimal tree structure with loyal users and batch updates
- Optimizing deletion cost for secure multicast key management
Cited in
(7)- Optimal trees for minimizing average individual updating cost
- Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost
- Optimal trees for minimizing average individual updating cost
- Optimizing deletion cost for secure multicast key management
- Optimal tree structures for group key tree management considering insertion and deletion cost
- Optimal tree structure with loyal users and batch updates
- Optimal Key Tree Structure for Deleting Two or More Leaves
This page was built for publication: Optimal key tree structure for two-user replacement and deletion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q358638)