scholarly journals Retraction notice to: “The Application of Symmetric Key Cryptographic Algorithms in Wireless Sensor Networks”

2012 ◽  
Vol 25 ◽  
pp. 2325
Author(s):  
Lingling Si ◽  
Zhigang Ji ◽  
Zhihui Wang
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.


2021 ◽  
Vol 11 (6) ◽  
pp. 7867-7874
Author(s):  
U. Iftikhar ◽  
K. Asrar ◽  
M. Waqas ◽  
S. A. Ali

Nowadays, terabytes of digital data are generated and sent online every second. However, securing this extent of information has always been a challenging task. Cryptography is a fundamental method for securing data, as it makes data unintelligible for attackers, offering privacy to authorized clients. Different cryptographic algorithms have different speeds and costs that make them suitable for different applications. For instance, banking applications need outrageous security amenities, as they utilize superior algorithms having greater requirements, while gaming applications focus more on speed and cost reduction. Consequently, cryptographic algorithms are chosen based on a client's prerequisites. This study compared DES, AES, Blowfish, and RSA, examining their speed, cost, and performance, and discussed their adequacy for use in wireless sensor networks and peer-to-peer communication.


2019 ◽  
Vol 32 (16) ◽  
pp. e4139 ◽  
Author(s):  
Anwar Ghani ◽  
Khwaja Mansoor ◽  
Shahid Mehmood ◽  
Shehzad Ashraf Chaudhry ◽  
Arif Ur Rahman ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document