Y. R. Yang, X. S. Li, X. B. Zhang, and S. S. Lam. Reliable group rekeying: a performance analysis. SIGCOMM: Proceedings of the 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Multimedia Security In Group Communications: Recent Progress in .. - Eskicioglu (2002) (4 citations) (Correct)
....increases with the multicast group size. 2.1. 2 Periodic Batch Rekeying In spite of the efficiency of the tree based scalable schemes for one to many applications, rekeying after each join or leave, i.e. individual rekeying, has two major drawbacks: synchronization problem and inefficiency [38]. Synchronization problem: If the group is rekeyed after each join or leave, synchorization will be difficult to maintain because of the interdependencies among rekey messages and also between rekey and data messages. If the delay in rekey message delivery is high and the join leave requests are ....
....may be digitally signed by the sender. Generation of digital signatures is a costly process in terms of computation and communication. A high rate of join leave requests may result in a performance degradation. One particular study attempts to minimize these problems with periodic batch rekeying [38]. In this approach, join leave requests are collected during a rekey interval and are rekeyed in a batch. The out of sync problems are alleviated by delaying the use of a new group key until the next rekey interval. Batch processing also leads to a definite performance advantage. For example, if ....
Y. R. Yang, X. S. Li, X. B. Zhang, S.S. Lam, Reliable Group Rekeying: A Performance Analysis, Proceedings of the ACM SIGCOMM '01, San Diego, CA, August 27-31, 2001, 27-38.
A Time Driven Methodology For Key Dimensioning In.. - Di Pietro, Mancini, Mei (Correct)
....could correctly decrypt the message. When a join occurs, the newly joined user u j receives the appropriate sequence of auxiliary keys from the center. The center encrypts such messages via the private key of u j , which is known only by the center and u j himself. It has been shown in [CGI 99; YLZL01] that the most complex rekeying operation is an eviction, and in the following we will deal with this kind of re keying operation. Moreover, a re keying operation due to a join can be performed according to an optimal algorithm described in 99] 3. The Threat Model and its Implication ....
....to deal with mass join. Moreover, this approach allows to save more than 50 of the computations required by the center in mass evictions and requires less computations on the user device than the other solutions. About reliability in multicast communication, the protocol proposed by Yang et al. YLZL01] uses proactive FEC in which parity packets are transmitted along with payload packets in each FEC block. An interesting approach proposed by some works [KCWP00; TSPL01] is to send the key updates in the same stream as data packets. The main advantage is that key updates are synchronized with the ....
Y. R. Yang, X. S. Li, X. B. Zhang, and S. S. Lam. Reliable group rekeying: a performance analysis. In Proc. of the 2001 conference on applications, technologies, architectures, and protocols for computer communications, pages 27-38. ACM Press, 2001.
On Dynamic Subset Difference Revocation Scheme - Chen, Ge, Zhang, Kurose, Towsley Self-citation (Zhang) (Correct)
No context found.
Y. Yang, X. Steve Li, X. Zhang, and S. S. Lam. Reliable group rekeying: A performance analysis. In ACM SIGCOMM'01, pages 27--38, San Diego, CA, 2001. 27
Group Rekeying with Limited Unicast Recovery - Zhang, Lam, Lee (2004) (2 citations) Self-citation (Zhang Lam) (Correct)
No context found.
Y.R. Yang, X.S. Li, X.B. Zhang, S.S. Lam, Reliable group rekeying: a performance analysis, in: Proceedings of ACM SIGCOMM 2001.
On Dynamic Subset Difference Revocation Scheme - Chen, Ge, Zhang, Kurose, Towsley Self-citation (Zhang) (Correct)
No context found.
Yang, Y., Li, X., Zhang, X., Lam, S.: Reliable Group Rekeying: A Performance Analysis. In: Proc. ACM SIGCOMM 2001, San Diego, CA (2001) 27-38
Reliable Group Rekeying: A Performance Analysis - Yang Richard Yang (16 citations) Self-citation (Yang Li Zhang Lam) (Correct)
No context found.
Y. R. Yang, X. S. Li, X. B. Zhang, and S. S. Lam. Reliable group rekeying: A performance analysis. Technical Report TR--01--21, The University of Texas at Austin, June 2001.
Group Rekeying with Limited Unicast Recovery - Brian Zhang Simon (2002) (2 citations) Self-citation (Zhang Lam) (Correct)
No context found.
Y. Richard Yang, X. Steve Li, X. Brian Zhang, and Simon S. Lam. Reliable group rekeying: A performance analysis. In Proceedings of ACM SIGCOMM 2001.
Group Rekeying with Limited Unicast Recovery - Zhang, Lam, Lee (2002) (2 citations) Self-citation (Zhang Lam) (Correct)
....members or restricting access to resources intended for group members only. The group key is distributed by a group key management system, which changes the group key from time to time (called group rekeying) The design of a group key management system has had extensive research in recent years [4, 6, 8, 11, 20, 22, 25, 26]. In particular, the key tree approach [20, 22] reduces the server processing time complexity of group rekeying from O(N)toO(log d (N) where N is group size and d the key tree degree. This approach was shown to be optimal in [19] A key tree is a rooted tree with the group key as root [22] There ....
....a user joins or leaves the group, all keys on the path from the user s unode to the root node should be changed. Rekeying after every join or leave request, however, can incur a large server processing overhead. Thus periodic batch rekeying was proposed to further reduce server processing overhead [17, 25, 10]. The key tree approach requires reliable delivery of new keys to users for group rekeying. This is because the key server uses keys for one rekeying interval to encrypt new keys for the next rekeying interval. Each user however does not have to receive the entire rekey message because it needs ....
[Article contains additional citation context not shown here]
Y. Richard Yang, X. Steve Li, X. Brian Zhang, and Simon S. Lam. Reliable group rekeying: A performance analysis. In Proceedings of ACM SIGCOMM 2001.
Group Rekeying with Limited Unicast Recovery - Zhang, Lam, Lee (2002) (2 citations) Self-citation (Zhang Lam) (Correct)
....computation overhead at the user side. In the Subset Difference approach, each rekey message contains 2 e keys, where e is the total number of revoked users from the beginning of a session until now. Therefore e can become a very large value as the session proceeds. For reliable delivery, [21, 23, 24] proposed the use of forward error correction (FEC) in an initial multicast, followed by the use of unicast delivery for users that cannot receive or recover their new keys from the multicast. Each unicast packet contains encrypted keys for only one particular user. Thus, the size of a unicast ....
Y. Richard Yang, X. Steve Li, X. Brian Zhang, and Simon S. Lam. Reliable group rekeying: A performance analysis. In Proceedings of ACM SIGCOMM 2001.
Protocol Design for Scalable and Reliable Group Rekeying - Zhang, Lam, Lee, Yang (2001) (2 citations) Self-citation (Yang Zhang Lam) (Correct)
No context found.
Y. R. Yang, X. S. Li, X. B. Zhang, and S. S. Lam, "Reliable group rekeying: A performance analysis," in Proceedings of ACM SIGCOMM
Addressing the Shortcomings of One-Way Chains - Di Pietro, Durante, Mancini.. (2006) (Correct)
No context found.
Y. R. Yang, X. S. Li, X. B. Zhang, and S. S. Lam. Reliable group rekeying: a performance analysis. SIGCOMM: Proceedings of the 2001.
Distributed Collaborative Key Agreement and Authentication.. - Lee, Lui, Yau (2005) (Correct)
No context found.
Y. R. Yang, X. S. Li, X. B. Zhang, and S. S. Lam. Reliable Group Rekeying: A Performance Analysis. Proc. of ACM SIGCOMM, August 2001.
Distributed Collaborative Key Agreement Protocols for.. - Patrick Lee Department (2002) (Correct)
No context found.
Y. R. Yang, X. S. Li, X. B. Zhang, and S. S. Lam. Reliable group rekeying: A performance analysis. Proc. of ACM SIGCOMM'01, August 2001.
Efficient Self-Healing Group Key Distribution with Revocation .. - Liu, Ning, Sun (2003) (1 citation) (Correct)
No context found.
Y. R. Yang, X. S. Li, X. B. Zhang, and Simon S. Lam. Reliable group rekeying: A performance analysis. In Proceedings of the ACM SIGCOMM '01 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pages 27--38, 2001.
SAKM: A Scalable and Adaptive Key Management Approach .. - Challal, Bettahar.. (2004) (Correct)
No context found.
Yang Richard Yang, X. Steve Li, X. Brian Zhang, and Simon S. Lam. Reliable Group Rekeying: A Performance Analysis. TR-01-21, June 2001.
Group Key Management Protocols: A Novel Taxonomy - Challal, Seba (2005) (Correct)
No context found.
Y.R. Yang, X.S. Li, X.B. Zhang, and S.S. Lam. Reliable Group Rekeying: A Performance Analysis. TR-01-21, June 2001.
Securing Dynamic Membership Information in Multicast Communications - Sun, Liu (2004) (1 citation) (Correct)
No context found.
Y. R. Yang, X. S. Li, X. B. Zhang, and S. S. Lam, "Reliable group rekeying: a performance analysis," Proc. of the 2001.
Scalable Hierarchical Access Control in Secure - Group Communications Yan (2004) (Correct)
No context found.
Y. R. Yang, X. S. Li, X. B. Zhang, and S. S. Lam, "Reliable group rekeying: a performance analysis," Proc. of the 2001.
Performance Comparison of Stateful and Stateless Group.. - Chen, Dondeti (2002) (2 citations) (Correct)
No context found.
Y. R. Yang, X. S. Li, X. R. Zhang, and S. S. Lam. Reliable Group Rekeying: A Performance Analysis. In Proceedings of ACM SIGCOMM'01, San Diego, CA, August 2001.
Performance Comparison of Stateful and Stateless Group.. - Chen, Dondeti (2003) (2 citations) (Correct)
No context found.
Y. R. Yang, X. S. Li, X. R. Zhang, and S. S. Lam. "Reliable Group Rekeying: A Performance Analysis ". In ACM SIGCOMM'01, pp. 27-38, San Diego, CA, August 2001.
Performance Comparison of Stateful and Stateless Group.. - Chen, Dondeti (2002) (2 citations) (Correct)
No context found.
Y. R. Yang, X. S. Li, X. R. Zhang, and S. S. Lam. "Reliable Group Rekeying: A Performance Analysis". In ACM SIGCOMM '01, pp. 27-38, San Diego, CA, August 2001.
Efficient Self-Healing Group Key Distribution with Revocation .. - Liu, Ning, Sun (2003) (1 citation) (Correct)
No context found.
Y. R. Yang, X. S. Li, X. B. Zhang, and Simon S. Lam. Reliable group rekeying: A performance analysis. In Proceedings of the ACM SIGCOMM '01 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pages 27--38, 2001.
Multimedia Security in Group Communications: Recent Progress in .. - Eskicioglu (2003) (4 citations) (Correct)
No context found.
Yang YR, Li XS, Zhang XB and Lam SS (2001) Reliable Group Rekeying: A Performance Analysis. Proceedings of the ACM SIGCOMM '01, San Diego, CA, August 27-31, 2001, pp. 27-38.
Performance Comparison of Stateful and Stateless Group.. - Chen, Dondeti (2002) (2 citations) (Correct)
No context found.
Y. R. Yang, X. S. Li, X. R. Zhang, and S. S. Lam. Reliable Group Rekeying: A Performance Analysis. In Proceedings of ACM SIGCOMM'01, San Diego, CA, August 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC