Algorithms for dynamic multicast key distribution trees
From MaRDI portal
Recommendations
- Algorithms for dynamic multicast key distribution
- Approximation Algorithms for Key Management in Secure Multicast
- Approximately optimal trees for group key management with batch updates
- Approximately Optimal Trees for Group Key Management with Batch Updates
- A lower bound for multicast key distribution
Cited in
(17)- A DC programming approach for solving a centralized group key management problem
- Key bundles and parcels: secure communication in many groups
- Grafting key trees: efficient key management for overlapping groups
- scientific article; zbMATH DE number 5811791 (Why is no real title available?)
- TRING: A new framework for efficient group key distribution for dynamic groups
- Algorithms for dynamic multicast key distribution
- scientific article; zbMATH DE number 2154500 (Why is no real title available?)
- scientific article; zbMATH DE number 1925552 (Why is no real title available?)
- Comparison of inter-area rekeying algorithms for secure wireless group communications
- scientific article; zbMATH DE number 2112372 (Why is no real title available?)
- scientific article; zbMATH DE number 1418321 (Why is no real title available?)
- Approximation Algorithms for Key Management in Secure Multicast
- Automated Technology for Verification and Analysis
- Secure key-updating for lazy revocation
- Solving a centralized dynamic group key management problem by an optimization approach
- A lower bound for multicast key distribution
- Optimizing deletion cost for secure multicast key management
This page was built for publication: Algorithms for dynamic multicast key distribution trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943761)