An Efficient Group Key Agreement Protocol for Ad Hoc Networks

Augot, Daniel; Bhaskar, Raghav; Issarny, Valérie; Sacchetti, Daniele

doi:10.1109/wowmom.2005.26

Cited by 25 publications

(10 citation statements)

References 14 publications

(22 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed key generation method includes multiple phases that can be organized according to the context in which the WSN is implemented. To implement this functionality, we consider the group Diffie-Hellman key exchange protocol introduced in [19]. 3.…”

Section: Proposed Security Architecturementioning

confidence: 99%

“…When all those messages have been exchanged, the sensors and the core node are authenticated using their private keys. The method used to establish this key is derived from the Diffie-Hellman key agreement protocol [20] and the work of Augot et al [19] which presents a method to generate a key for a group. Initially, all the nodes agree on a cyclic group G and on two numbers p and g, where p is a prime number and g is a primitive root modulo p. The nodes have also a predeployed value S which is secret and known only by the trusted sensors.…”

Section: Initial and Authentication Exchangesmentioning

confidence: 99%

See 1 more Smart Citation

DynTunKey: a dynamic distributed group key tunneling management protocol for heterogeneous wireless sensor networks

Bellazreg

Boudriga

2014

J Wireless Com Network

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) are being used for many applications ranging from mobile target surveillance to intelligent home networking. Due to the sensitive nature of the data transmitted by these applications, appropriate protection mechanisms are needed to prevent attackers from exploiting the weaknesses of the radio links. In this paper, we propose a novel group key management scheme called DynTunKey (dynamic tunneling and group key management protocol). This paper investigates the use of secure tunnels as a solution to improve the protection of WSNs. We propose a tunneling scheme that conforms to the security requirements of WSNs while having less computational and network overhead. We also propose a solution for a dynamic integration in the secured communication of a newly deployed sensor. A set of experiments has been conducted to assess the performance of the proposed scheme with regard to recent key management protocol and to traditional tunnels built using the IPSec protocol. We found that our protocol considerably reduces the number of transmitted messages as well as the computational load, which makes it suitable for WSNs. We tested the proposed protocol considering two models of mobility of the targets which are respectively the Random Walk model and the Gauss Markov model.

show abstract

Section: Proposed Security Architecturementioning

confidence: 99%

Section: Initial and Authentication Exchangesmentioning

confidence: 99%

DynTunKey: a dynamic distributed group key tunneling management protocol for heterogeneous wireless sensor networks

Bellazreg

Boudriga

2014

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…And the new key is g r * 10 (1+r * 1 +r 2 +r 4 +r 5 +r 9 ) . 3 The group leader can be different from the initiator; see Section 4.2 for leader election issues.…”

Section: Join/mergementioning

confidence: 99%

A three round authenticated group key agreement protocol for ad hoc networks

Augot

Bhaskar

Issarny

et al. 2007

Pervasive and Mobile Computing

View full text Add to dashboard Cite

Group Key Agreement (GKA) protocols enable the participants to derive a key based on each one's contribution over a public network without any central authority. They also provide efficient ways to change the key when the participants change. While some of the proposed GKA protocols are too resource consuming for the constraint devices often present in ad hoc networks, others lack a formal security analysis. In this paper, we propose a simple, efficient and secure GKA protocol well-suited to ad hoc networks and present results of our implementation of the same in a prototype application.

show abstract

“…In fact, many cryptographic protocols for peer-to-peer ad hoc networks, most notably, group key agreement protocols [3,4,20], also make this assumption. This can be justified by relying on reliable group communication services, such as [17,18].…”

Section: System Assumptionsmentioning

confidence: 99%