Approximation Algorithms for Key Management in Secure Multicast

DOI10.1007/978-3-642-02882-3_16MaRDI QIDQ5323059zbMATH OpenOpenAlexFDO

Authors Rajmohan Rajaraman, Zhifeng Sun, Feng Zhu, A. H. Chan

Publication date 23 July 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02882-3_16

Mathematics Subject Classification ID

Cryptography (94A60) Approximation algorithms (68W25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Algorithms for dynamic multicast key distribution
• Algorithms for dynamic multicast key distribution trees
• Approximately optimal trees for group key management with batch updates
• A lower bound for multicast key distribution
• Approximately Optimal Trees for Group Key Management with Batch Updates

Cites work

• scientific article; zbMATH DE number 3162350 (Why is no real title available?)
• scientific article; zbMATH DE number 1304090 (Why is no real title available?)
• scientific article; zbMATH DE number 6472583 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• A lower bound for multicast key distribution
• An information-theoretic approach for design and analysis of rooted-tree-based multicast key management schemes
• Approximation Algorithms for Key Management in Secure Multicast
• Automata, Languages and Programming
• Balancing minimum spanning trees and shortest-path trees
• Broadcast scheduling optimization for heterogeneous cluster systems
• Broadcasting in heterogeneous networks
• Huffman coding with unequal letter costs

Cited in

(12)

• A lower bound for multicast key distribution
• Cost of multicast logical key tree based on hierarchical data processing
• Approximately optimal trees for group key management with batch updates
• Symmetric threshold multipath (STM): an online symmetric key management scheme
• Algorithms for dynamic multicast key distribution trees
• scientific article; zbMATH DE number 1930760 (Why is no real title available?)
• Algorithms for dynamic multicast key distribution
• Key bundles and parcels: secure communication in many groups
• Optimal key tree structure for two-user replacement and deletion problems
• 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

Describes a project that uses

Uses Software

• Iolus

This page was built for publication: Approximation Algorithms for Key Management in Secure Multicast

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5323059)