Approximation Algorithms for Key Management in Secure Multicast

DOI10.1007/978-3-642-02882-3_16zbMath1248.68554OpenAlexW1584624422MaRDI QIDQ5323059

Feng Zhu, Rajmohan Rajaraman, Zhifeng Sun, Agnes Hui 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)

Related Items (2)

Optimal key tree structure for two-user replacement and deletion problems ⋮ Approximation Algorithms for Key Management in Secure Multicast

Uses Software

• Iolus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound for multicast key distribution
• Broadcasting in heterogeneous networks
• Balancing minimum spanning trees and shortest-path trees
• Broadcast Scheduling Optimization for Heterogeneous Cluster Systems
• Huffman coding with unequal letter costs
• 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
• A Method for the Construction of Minimum-Redundancy Codes

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