Parity-based loss recovery for reliable multicast transmission
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Effective erasure codes for reliable computer communication protocols
ACM SIGCOMM Computer Communication Review
Secure group communications using key graphs
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
pgmcc: a TCP-friendly single-rate multicast congestion control scheme
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Batch rekeying for secure group communications
Proceedings of the 10th international conference on World Wide Web
Reliable group rekeying: a performance analysis
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Extending equation-based congestion control to multicast applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
MARKS: Zero Side Effect Multicast Key Management Using Arbitrarily Revealed Key Sequences
NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
General AIMD congestion control
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Kronos: A Scalable Group Re-Keying Approach for Secure Multicast
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
ELK, a New Protocol for Efficient Large-Group Key Distribution
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
Protocol design for scalable and reliable group rekeying
IEEE/ACM Transactions on Networking (TON)
IEEE Communications Magazine
Secure group communication in wireless mesh networks
Ad Hoc Networks
Anonymous distribution of encryption keys in cellular broadcast systems
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
| Hi-index | 0.00 |
In secure group communications, a key server can deliver a "group-oriented" rekey message [C.K. Wong, M.G. Gouda, S.S. Lam, Secure group communications using key graphs, in: Proceedings of ACM SIGCOMM '98, September 1998, pp. 68-79] to a large number of users efficiently using multicast. For reliable delivery, Keystone [C.K. Wong, S.S. Lam, Keystone: a group key management system, in: Proceedings of International Conference on Telecommunications, Acapulco, Mexico, May 2000] proposed the use of forward error correction (FEC) in an initial multicast, followed by the use of unicast delivery for users that cannot recover their new keys from the multicast. In this paper, we investigate how to limit unicast recovery to a small fraction r of the user population. By specifying a very small r, almost all users in the group will receive their new keys within a single multicast round.We present analytic models for deriving r as a function of the amount of FEC redundant information (denoted by h) and the rekeying interval duration (denoted by T) for both Bernoulli and two-state Markov Chain loss models. From our analyses, we conclude that r decreases roughly at an exponential rate as h increases. We then present a protocol designed to adaptively adjust (h, T) to achieve a specified r. In particular, our protocol chooses from among all feasible (h, T) pairs one with h and T values close to their feasible minima. Our protocol also adapts to an increase in network traffic. Simulation results using ns-2 show that with network congestion our adaptive FEC protocol can still achieve a specified r by adjusting values of h and T.