A Dynamic and Distributed Key Management Scheme for Wireless Sensor Networks

Laouid, Abdelkader; Messai, Mohamed-Lamine; Bounceur, Ahcène; Euler, Reinhardt; Dahmani, Abdelnasser; Tari, Abdelkamel

doi:10.1145/2896387.2900322

Cited by 7 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the nature of such connected devices limits the use of conventional key establishment techniques. Many researchers have proposed to use symmetric key pre-distribution schemes for the key establishment objective [40,42]. These schemes consider the resource limitation, the communication capability and the computation speed [43].…”

Section: Key Establishment Algorithmmentioning

confidence: 99%

A flexible encryption technique for the internet of things environment

et al. 2020

Self Cite

View full text Add to dashboard Cite

IoT promises a new era of connectivity that goes beyond laptops and smart connected devices to connected vehicles, smart homes, smart cities and connected healthcare. The huge volume of data that is collected from millions of IoT devices raises information security and privacy concerns for users. This paper presents a new scalable encryption technique, called Flexible encryption Technique (FlexenTech), to protect IoT data during storage and in transit. FlexenTech is suitable for resource constrained devices and networks. It offers a low encryption time, defends against common attacks such as replay attacks and defines a configurable mode, where any number of rounds or key sizes may be used. Experimental analysis of FlexenTech shows its robustness in terms of its multiple configurable confidentiality levels by allowing various configurations.This configurability provides several advantages for resource constrained devices, including reducing the encryption computation time by up to 9.7% when compared to its best rivals in the literature.

show abstract

Section: Key Establishment Algorithmmentioning

confidence: 99%

A flexible encryption technique for the internet of things environment

et al. 2020

Self Cite

View full text Add to dashboard Cite

show abstract

“…Three GKA protocols are proposed by Álvarez‐Bermejo et al, 32 all of these protocols are derived from Diffie–Hellman method, group keys are shared among different nodes, and security key distribution is performed. Laouid Abdelkader et al 33 proposed a new resource‐aware key management technology. The initial key is not predistributed in nodes in this scheme, which can improve the node's resistance to attack.…”

Section: Introductionmentioning

confidence: 99%

Group key agreement protocol among terminals of the intelligent information system for mobile edge computing

Zhang

Zhu

Wang

et al. 2021

Int J of Intelligent Sys

View full text Add to dashboard Cite

Security communication and information sharing among mobile devices are important application technologies of the intelligent information system (IIS). Because IIS is vulnerable to attacks, so the security of information sharing among mobile devices is seriously threatened. Thence, it is necessary to establish a secure channel for communication among mobile devices of IIS over an opening network. Group key agreement (GKA) can establish a secure channel among mobile devices of IIS by encryption technology. Due to the resource‐constraints of mobile devices, such as weak computing power, small storage capacity, and limited communication range. To address these issues, an asymmetric GKA protocol among terminals of IIS for mobile edge computing (GKA–IIS–MEC) network is proposed in this paper. Adopted asymmetric GKA to achieve the group secure communication mechanisms that message sender unfettered in this protocol; the protocol also uses edge computing environment to migrate the computation and communication loads of mobile devices of IIS to edge nodes, thereby ensuring that mobile devices have lightweight computation and communication loads; and the members participating in the GKA can verify whether the group session keys they calculated are correctness. Under the hardness assumption of bilinear inverse Diffie–Hellman problem, the proposed protocol is proven that it can resist negative attacks. After evaluating the performance of the protocol, GKA–IIS–MEC has higher efficiency than the referred works in terms of time cost, communication consumption, and computation consumption.

show abstract

“…So this protocol is particularly suitable for large and dense Network. In Reference [15], attacks on WSNs protocols generally fall into one of two following categories: routing-disruption attacks and resource consumption attacks. Wormhole attack is classified into routing-disruption attacks.…”

Section: Introductionmentioning

confidence: 99%

Attacks and Secure Geographic Routing In Wireless Sensor Networks

Sabri

Kamoun

2017

IJEECS

View full text Add to dashboard Cite

Due to open network nature of wireless sensor networks make them highly vulnerable to a variety of security attacks and easy target for adversaries, which may capture these nodes, analyze and easily insert fake route information. Wireless sensor network is an emerging, cost effective and unsupervised solution for collecting this information from the physical world and sending this information back to centralized authority for further processing. GRPW (Geographic Routing in connected wireless sensor networks based on Multiple Sinks) is one of the basic routing protocols used for Supporting Mobile Sinks in Wireless Sensor Networks . GRPW , a geographical routing protocol for wireless sensor networks , is based on an architecture partitioned by logical levels, on the other hand based on a multipoint relaying flooding technique to reduce the number of topology broadcast. GRPW-MuS uses periodic HELLO packets to neighbor detection. As introduced in Reference [1, 2], the wormhole attack can form a serious threat in wireless sensor networks, especially against many wireless sensor networks routing protocols and location-based wireless security systems.Here, a trust model to handle this attack in GRPW is provided called GRPW-MuS-s . Using OMNET++ simulation and the MiXiM framework, results show that GRPW-MuS-s protocol only has very small false positives for wormhole detection during the neighbor discovery process (less than GRPW). The average energy usage at each node for GRPW-MuS-s protocol during the neighbor discovery and route discovery is very low than GRPW-MuS, which is much lower than the available energy at each node. The cost analysis shows that GRPW-MuS-s protocol only needs small memory usage at each node , which is suitable for the sensor network.

show abstract

A Dynamic and Distributed Key Management Scheme for Wireless Sensor Networks

Cited by 7 publications

References 13 publications

A flexible encryption technique for the internet of things environment

A flexible encryption technique for the internet of things environment

Group key agreement protocol among terminals of the intelligent information system for mobile edge computing

Attacks and Secure Geographic Routing In Wireless Sensor Networks

Contact Info

Product

Resources

About