Dynamic Group Key Agreement Protocols Sample Clauses

Dynamic Group Key Agreement Protocols. The protocols mentioned before are all static group key agreement protocols. In static GKA protocols, when participants in the group change, the protocol needs to be started from the beginning. On the other hand, dynamic GKA protocols provide auxiliary operations (defined in Section 2.1.1) that require much less computation effort such as in [5, 6, 11, 20– 23]. To increase efficiency in group key computation, tree-based group key agreement pro- tocols are proposed in [5, 9]. Xxxxx et al. [5] propose a dynamic tree-based group key agree- ment protocol where participants are hierarchically positioned as a tree structure. In the lower leaves, subgroup of participants computes group key, and forwards to the participants at the upper leaves. And this process goes until the common group key is computed in the root of the tree. Alternative approaches are introduced by utilizing cluster structures in [6, 8]. Xxxxx et al. have proposed a cluster-based dynamic group key protocol called GKAP-MANET [6]. In this protocol, the participants are grouped as a set of a clusters and each cluster has a cluster head. Two types of communication occur between participants; first, between participants in the same cluster and second, between the cluster heads. Therefore, the cluster key is firstly agreed with the participants in the same cluster while, later on, cluster heads agree on the common group key. An asymmetric GKA protocol is proposed by Xx et al. in [14]. In this protocol, instead of participants agreeing on a symmetric group key, a public key is shared among the participants. This key is used to verify signatures, and encrypt transmitted messages. The shared public key corresponds to the private keys of the participants, which can only be generated by the owner. The participants use their private keys for decrypting and signing the messages. This protocol ensures key agreement in a single round.