Matrix-based memory efficient symmetric key generation and pre-distribution scheme for wireless sensor networks

2012 ◽  
Vol 2 (2) ◽  
pp. 108 ◽  
Author(s):  
E. Khan ◽  
E. Gabidulin ◽  
B. Honary ◽  
H. Ahmed
2013 ◽  
Vol 33 (7) ◽  
pp. 1851-1853 ◽  
Author(s):  
Ji ZHANG ◽  
Xiaoni DU ◽  
Xu LI ◽  
Jipo LIN

Author(s):  
Jyothi R. ◽  
Nagaraj G. Cholli

Wireless sensor network (WSN) have limited bandwidth, low computational functions, energy constraints. Inspite of these constraints, WSN is useful where communication happens without infrastructure support. The main concern of WSN is the security as the sensor nodes may be attacked and information may be hacked. Security of WSN should have the capability to ensure that the message received was sent by the particular sent node and not modified during transmission. WSN applications require lightweight and strong authentication mechanisms for obtaining data from unprivileged users. In wireless sensor networks, authentication is the effective method to stop unauthorized and undisrupted communication service. In order to strengthen the authenticated communication, several researchers have developed mechanisms. Some of the techniques work with identifying the attacked node or detecting injected bogus message in the network. Encryption and decryption are the popular methods of providing the security. These are based on either public-key or symmetric-key cryptosystems Many of the existing solutions have limitations in communication and computational expertise. Also, the existing mechanisms lack in providing strength and scalability of the network. In order address these issues; a polynomial based method was introduced in recent days. Key distribution is a significant aspect in key management in WSNs. The simplest method of distribution of key is by hand which was used in the days of couriers. Now a days, most distribution of keys is done automatically. The automatic distribution of keys is essential and convenient in networks that require two parties to transmit their security keys in the same communication medium. In this work, a new type of key exchange mechanism is proposed. The proposed method for authentication among sensor nodes proves to be promising as per the simulation results. The nodes which are unknown to each other setup a private however arbitrary key for the symmetric key cryptosystem.


Author(s):  
Sirasani Srinivasa Rao ◽  
K. Butchi Raju ◽  
Sunanda Nalajala ◽  
Ramesh Vatambeti

Wireless sensor networks (WSNs) have as of late been created as a stage for various significant observation and control applications. WSNs are continuously utilized in different applications, for example, therapeutic, military, and mechanical segments. Since the WSN is helpless against assaults, refined security administrations are required for verifying the information correspondence between hubs. Because of the asset limitations, the symmetric key foundation is considered as the ideal worldview for verifying the key trade in WSN. The sensor hubs in the WSN course gathered data to the base station. Despite the fact that the specially appointed system is adaptable with the variable foundation, they are exposed to different security dangers. Grouping is a successful way to deal with vitality productivity in the system. In bunching, information accumulation is utilized to diminish the measure of information that streams in the system.


2020 ◽  
Vol 16 (6) ◽  
pp. 155014772092577 ◽  
Author(s):  
Shahwar Ali ◽  
A Humaria ◽  
M Sher Ramzan ◽  
Imran Khan ◽  
Syed M Saqlain ◽  
...  

In wireless sensor networks, the sensors transfer data through radio signals to a remote base station. Sensor nodes are used to sense environmental conditions such as temperature, strain, humidity, sound, vibration, and position. Data security is a major issue in wireless sensor networks since data travel over the naturally exposed wireless channel where malicious attackers may get access to critical information. The sensors in wireless sensor networks are resource-constrained devices whereas the existing data security approaches have complex security mechanisms with high computational and response times affecting the network lifetime. Furthermore, existing systems, such as secure efficient encryption algorithm, use the Diffie–Hellman approach for key generation and exchange; however, Diffie–Hellman is highly vulnerable to the man-in-the-middle attack. This article introduces a data security approach with less computational and response times based on a modified version of Diffie–Hellman. The Diffie–Hellman has been modified to secure it against attacks by generating a hash of each value that is transmitted over the network. The proposed approach has been analyzed for security against various attacks. Furthermore, it has also been analyzed in terms of encryption/decryption time, computation time, and key generation time for different sizes of data. The comparative analysis with the existing approaches shows that the proposed approach performs better in most of the cases.


2019 ◽  
Vol 1229 ◽  
pp. 012066
Author(s):  
Chao Xiong ◽  
Shuquan Li ◽  
Lei Liu ◽  
Rui Li ◽  
Yanjiao Jin

Sign in / Sign up

Export Citation Format

Share Document