Michael Steiner, Gene Tsudik, and Michael Waidner, "Key agreement in dynamic peer groups," in IEEE Transactions on Parallel and Distributed Systems, July 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... in which up to one hundred parties work together in order to get a task done where many of the parties may be sending data to the multicast group [13] Examples of such applications include replicated server [23] audio video conferencing [22] and collaborative tools [2] Several papers [3,20,21,30] have addressed this scenario and one of its incarnations is the system ooeered in [1] However these protocols, and this existing system, are based on or use an informal approach and do not rely on proofs of security. These approaches are several years later often found to be AEawed and, indeed, ....

....scenario in which the membership is static and known in advance. However these protocols are not well suited for a scenario in which members join and leave the multicast group at a relatively high rate. Fortunately, these protocols can be extended to address this latter scenario and several papers [3,20,21,30] have shown how to do so. The protocol presented in [3] has been found to be AEawed in [25] and the other papers assume authenticated links, or more specically do not consider the AKE and MA goals as part of the protocols. These goals need to be addressed separately. A rst step has already been ....

Steiner, M., Tsudik, G., Waidner, M.: Key agreement in dynamic peer group. IEEE Transactions on Parallel and Distributed Systems 11 (2000) 769780.

....ad hoc networks focuses on secure routing [1] 2] 3] However, these studies assume that a secret cryptographic key is shared among the devices that constitute the ad hoc network. Some work has been done on developing group key establishment protocols [4] 5] 6] 7] 8] 9] 10] [11]. However, these protocols are generic, not being specified for a specific kind of network. Little work has been done on adapting or evaluating the use of these protocols over wireless ad hoc networks. In [12] a fault tolerant version of the Hypercube protocol [6] with authentication support is ....

....in a logical hypercube. In [5] a protocol, referred to in this work as BD, in which every device broadcasts two sets of information to all the other devices in such a way that every device is able to compute a common group key is proposed. Two other protocols, IKA.1 and IKA.2 [7] 8] 9] 10] [11], initially collect contributions for the group key from all the group members, one by one, and then broadcasts these contributions for all the group members. These protocols are presented in details in Sections II A and II B. These protocols specify the need for data broadcast. However they were ....

M. Steiner, G. Tsudik, and M. Waidner, "Key agreement in dynamic peer groups," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 8, pp. 769--780, Aug. 2000.

....The product of these keys is used to establish a key among the core nodes as specified by the Hypercube protocol. This key is then distributed to the other nodes. A B C B C D ) g Figure 1: Hypercube protocol for n = 4. 2. 5 The CLIQUES protocol suite Developed by Steiner et al. [2, 7, 8, 9, 10], the CLIQUES protocol suite consists of key management protocols for dynamic groups. Two of these protocols, IKA.1 e IKA.2 (Initial Key Agreement 1 and 2) are defined for group key establishment. Other protocols are specified for member and subgroup addition and exclusion and key refresh. The ....

Michael Steiner, Gene Tsudik, and Michael Waidner, "Key agreement in dynamic peer groups," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 8, pp. 769-- 780, Aug. 2000.

....for this to succeed. In general, extensions of this scheme to the important group key agreement problem, where a group of principals has to agree on a common key, unavailable to external eavesdroppers, and not created by any single principal in the group, as in the CLIQUES protocol suite [41], require to be both associative and commutative; multiplication mod N certainly is. If we are to extend the tree automata based approaches to cryptographic protocol verification to such AC operators, we need suitably modified notions of automata recognizing terms modulo the theory of ....

....(Section 6) 6 3 An Application in Cryptographic Protocol Verification We give an example in the field of group key agreement schemes. To keep the exposition short, we only mention salient features exhibiting the role of AC tree automata. Consider the initial key agreement protocol IKA.1 [41] (formerly known as GDH.2) used to create an initial group key in the CLIQUES protocol suite. This works as follows; remember that we have a cryptographic hash function e, and an AC operation with unit 0, typically implemented by e(M) mod N , being multiplication and 0 being 1. We also ....

M. Steiner, G. Tsudik, and M. Waidner. Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems, 11(8):769--780, 2000.

No context found.

M. Steiner, G. Tsudik, and M. Waidner. Key agreement in dynamic peer groups. IEEE TPDS, 11(8):769--780, 2000.

No context found.

Michael Steiner, Gene Tsudik, and Michael Waidner. Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems, 11(8):769-- 780, August 2000. 243

....who knows a subset of group keys cannot discover preceding group keys. Perfect Forward Secrecy means that a compromise of a member s long term key cannot lead to the compromise of any shortterm group keys. For a more precise definition of the above terminology, the reader is referred to [23] [24]. The key agreement protocol we use in our design is called Tree Based Group Diffie Hellman [25] TGDH) It provides key independence and perfect forward secrecy; it was also proven secure with respect to passive outside (eavesdropping) adversaries [26] In addition, active outsider attacks ....

....currently supports five key management protocols. One of them implements centralized key distribution and is referred to as the Centralized Group Key Distribution (CKD) The other four are key agreement protocols: Burmester Desmedt (BD) 29] Steer et al. STR) 25] Group Diffie Hellman (GDH) [24] and Tree Based Group Diffie Hellman (TGDH) 27] Each of the latter four protocols are based on various group extensions of the well known (2 party) Diffie Hellman key exchange [30] For encryption, only one algorithm (Blowfish [31] is currently supported. 4.3 Integrated Architecture Early ....

M. Steiner, G. Tsudik, and M. Waidner, "Key agreement in dynamic peer groups," IEEE Transactions on Parallel and Distributed Systems, August 2000.

....who knows a subset of group keys cannot discover preceding group keys. Perfect Forward Secrecy means that a compromise of a member s long term key cannot lead to the compromise of any short term group keys. For a more precise definition of the above terminology, the reader is referred to [25] [26]. The key agreement protocol we use in our design is called TGDH [27] Tree Based Group Diffie Hellman) It provides key independence and perfect forward secrecy; it was also proven secure with respect to passive outside (eavesdropping) adversaries [28] In addition, active outsider attacks ....

....currently supports five key management protocols. One of them implements centralized key distribution and is referred to as the Centralized Group Key Distribution (CKD) The other four are key agreement protocols: Burmester Desmedt (BD) 31] Steer et al. STR) 27] Group Diffie Hellman (GDH) [26] and Tree Based Group Diffie Hellman (TGDH) 29] Each of the latter four protocols are based on various group extensions of the well known (2 party) Diffie Hellman key exchange [32] For encryption, only one algorithm (Blowfish [33] is currently supported. 4.3 Integrated Architecture Early ....

M. Steiner, G. Tsudik, and M. Waidner, "Key agreement in dynamic peer groups," IEEE Transactions on Parallel and Distributed Systems, August 2000.

No context found.

Michael Steiner, Gene Tsudik, and Michael Waidner, "Key agreement in dynamic peer groups," in IEEE Transactions on Parallel and Distributed Systems, July 2000.

No context found.

Steiner, M., Tsudik, G., and M.Waidner. 2000. Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems.

No context found.

M. Steiner, G. Tsudik, and M. Waidner. Key Agreement in Dynamic Peer Groups. IEEE Transactions on Parallel and Distributed Systems, 11(8):769--780, Aug 2000.

No context found.

M. Steiner, G. Tsudik, and M. Waidner. Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems, 11(8):769--780, August 2000.

No context found.

M. Steiner, G. Tsudik and M. Waidner. Key Agreement in Dynamic Peer Groups. IEEE Transactions on Parallel and Distributed Systems, 2000.

No context found.

M. Steiner, G. Tsudik, and M. Waidner. Key agreement in dynamic peer groups. IEEE Transaction on Parallel and Distributed Systems, 11(8):769-780, August 2000.

No context found.

M. Steiner, G. Tsudik, , and M. Waidner, "Key agreement in dynamic peer groups," IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, vol. 11, no. 8, pp. 769--780, Aug 2000.

No context found.

M. Steiner, G. Tsudik, and M. Waidner. Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems, 11(8):769--780, 2000.

No context found.

M. Steiner, G. Tsudik, , and M. Waidner, "Key agreement in dynamic peer groups," IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, vol. 11, no. 8, pp. 769--780, Aug 2000.

No context found.

M. Steiner, G. Tsudik, and M. Waidner, "Key agreement in dynamic peer groups," IEEE Transactions on Parallel and Distributed Systems, August 2000.

No context found.

Michael Steiner, Gene Tsudik, and Michael Waidner. Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems, 11(08), August 2000.

No context found.

M. Steiner, G. Tsudik, and M. Waidner. Key Agreement in Dynamic Peer Groups. IEEE Trans. on Parallel and Distributed Systems 11(8): 769--780 (2000). A preliminary version appeared in ACM CCCS '96.

No context found.

M. Steiner, G. Tsudik, and M. Waidner. Key Agreement in Dynamic Peer Groups. IEEE Trans. on Parallel and Distributed Systems 11(8): 769--780 (2000).

No context found.

M. Steiner, G. Tsudik, and M. Waidner. Key Agreement in Dynamic Peer Groups. IEEE Trans. on Parallel and Distributed Systems 11(8): 769--780 (2000).

No context found.

Michael Steiner, Gene Tsudik, and Michael Waidner. Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems, 11(8):769780, August 2000.

No context found.

M. Steiner, G. Tsudik, and M. Waidner. Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems, 11(8):769--780, 2000.

No context found.

M. Steiner, G. Tsudik, and M. Waidner. Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems, 11(8):769--780, August 2000.

First 50 documents

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