Sciweavers

60 search results - page 1 / 12
» Optimal Communication Complexity of Generic Multicast Key Di...
Sort
View
EUROCRYPT
2004
Springer
13 years 10 months ago
Optimal Communication Complexity of Generic Multicast Key Distribution
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...
Daniele Micciancio, Saurabh Panjwani
INFOCOM
2010
IEEE
13 years 3 months ago
An Optimal Key Distribution Scheme for Secure Multicast Group Communication
Abstract— Many IP multicast-based applications, such as multimedia conferencing, multiplayer games, require controlling the group memberships of senders and receivers. One common...
Zhibin Zhou, Dijiang Huang
TPDS
2008
125views more  TPDS 2008»
13 years 4 months ago
Computation-Efficient Multicast Key Distribution
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...
Lihao Xu, Cheng Huang
CRYPTO
1999
Springer
152views Cryptology» more  CRYPTO 1999»
13 years 8 months ago
An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes
Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18, 19, 20, 21]. In this paper, we show that by ass...
Radha Poovendran, John S. Baras
NETWORKING
2007
13 years 6 months ago
Construction of a Proxy-Based Overlay Skeleton Tree for Large-Scale Real-Time Group Communications
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...
Jun Guo, Sanjay Jha