An improved conference‐key agreement protocol for dynamic groups with efficient fault correction

Abstract

The pervasive usage of the Internet has made secure group communications a significant issue. Conference-key agreement protocols provide secure group communications with lower computational cost. Providing key agreements and updates of dynamic groups in an efficient manner is a significant challenge for conference-key agreement protocols. Auxiliary key agreement operations are needed to solve the challenge. In this paper, we propose an improved conference-key agreement protocol, called Dynamic Conference-Key Agreement Protocol, that consists of Initial Conference-Key Agreement Protocol and Auxiliary Conference-Key Agreement operations. Dynamic Conference-Key Agreement Protocol has operations to handle dynamic groups. The proposed protocol has better fault correction and provides the same security level with the existing ones.

Dynamic Group Key Agreement for Resource-constrained Devices Using Blockchains

“…Comparison for the computational and communications costs of B-GKAP with other well-known dynamic group key agreement protocols [10,[12][13][14]26] is given in Table 2. For instance, GKAP-MANET protocol relies on the most efficient group key proposed by Burmester and Desmedt (BD) in [4].…”

“…Nevertheless, these protocols were designed specifically for static groups, which means any change in the set of communicating parties requires the re-execution of the group key agreement protocol for all communicating participants. In this work, our main focus is the dynamic group key agreement (DGKA) protocols that use some auxiliary functions to update the group key without re-executing the protocol from scratch for all participants as elaborated in [7,9,10,[12][13][14]25]. These protocols have many application areas such as conference communication [12], secure file sharing systems [13], and secure communication in Mobile Ad Hoc Networks (MANETs) [14].…”

“…In this work, our main focus is the dynamic group key agreement (DGKA) protocols that use some auxiliary functions to update the group key without re-executing the protocol from scratch for all participants as elaborated in [7,9,10,[12][13][14]25]. These protocols have many application areas such as conference communication [12], secure file sharing systems [13], and secure communication in Mobile Ad Hoc Networks (MANETs) [14]. Although the listed protocols have proposed efficient group key computation approaches, novel solutions are necessary to overcome the overhead of verification operations during group key computation while dealing with large groups.…”

“…On the other hand, some protocols provide additional functionalities to handle the re-execution overhead. Such protocols are called Dynamic Group Key Agreement (DGKA) protocols [10,[12][13][14]27]. Although DGKA protocols are more efficient compared to static ones, there exist some other several factors which affect their performance -the first one is the way of broadcasting key agreement parameters and the second being the validation of participant identities via verification of received parameters.…”