A New Key Management Scheme for Wireless Sensor Networks using an Elliptic Curve

Singh, Shailendra; Khan, Ajoy Kumar; Singh, Takhellambam Sonamani

doi:10.17485/ijst/2017/v10i13/108661

Cited by 13 publications

(19 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The parameter calculates the amount of time an algorithm takes on a specific amount of data. The results of the proposed approach are compared with the research results in the study by Singh et al 14 Table 2 in the study by Singh et al 14 shows the performance of their proposed scheme. Where the key generation, encryption, and decryption are performed on 10-byte length of data where the key varies in terms of different ECC values generated.…”

Section: Computational Timementioning

confidence: 98%

“…12 In terms of security, this algorithm only uses exclusive or (XOR) operation for the encryption, making it uncertain against the known-plaintext and chosen-plaintext attacks. 13 Additional research proposed elliptic curve cryptography-key management (E-KM) 14 where a key organizing procedure is presented. This research methodology is insecure against a collision search attack.…”

Section: Literature Reviewmentioning

confidence: 99%

“…better than the research approach in the study by Singh et al 14 Since the key is generated through the SMDH approach, it is highly difficult to break because the private key of both parties is never passed over the network and random numbers are used to generate common parameters for the public key. Table 10 explains the length of the data versus the amount of time taken to generate key, encryption, and decryption.…”

Section: Computational Timementioning

confidence: 99%

“…The following paper shows the procedure of how the RSA is attackable. 79 Small public and private key are can also occur as given in Biham 80 E-KM 14 -Because of ECC collision attack occur. 15 And invalid curve attack can also occurs 16 ECB_PU 81 -Vulnerable to chosen-plaintext attack 82 M.XOR 27 -This proposed algorithm uses PRNG, to randomly generate number uniquely, which make this algorithm suffer from direct cryptanalysis attack, input-based attack, meet-in-the-middle attack, and many more, as proved in Kelsey et al 38 C-AB 50 Eavesdrop does not occur SHA-3 can get effected from differential attack 51 E-AES 83 -The problem occurred in the planned procedure is security, high complexity and has high communication overhead, as mentioned in Ullah et al 5 (continued) International Journal of Distributed Sensor Networks…”

mentioning

confidence: 99%

See 3 more Smart Citations

An efficient cryptographic technique using modified Diffie–Hellman in wireless sensor networks

Ali

Humaria

Ramzan

et al. 2020

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

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.

show abstract

Section: Computational Timementioning

confidence: 98%

Section: Literature Reviewmentioning

confidence: 99%

Section: Computational Timementioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

An efficient cryptographic technique using modified Diffie–Hellman in wireless sensor networks

Ali

Humaria

Ramzan

et al. 2020

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…A Chain Based Cluster Co-operative Protocol (CBCCP) is projected in (9) and Markov model is taken into account in (10) . Monjul Saikia (11) recommend a new network structure model, compared to the original energy consumption model (12) , the formula for finding the optimal cluster number in the area is proposed in a given WSN.…”

Section: Introductionmentioning

confidence: 99%

An efficient hybrid model for cluster head selection to optimize wireless sensor network using simulated annealing algorithm

Umashankar¹,

Anitha²,

Mallikarjunaswamy³

2021

IJST

View full text Add to dashboard Cite

Objective: Energy efficiency aspect in wireless sensor networks (WSN) can be achieved by small sized rechargeable and easily replaceable batteries. The lifetime of wireless sensor network can be improved by identifying the efficient and reliable nodes as a cluster heads using Hybrid Simulated Annealing algorithm. The proposed algorithm identifies cluster head to reduce overhead and is capable of handling high volume of nodes with minimum node death rate. Methods: This study proposed initialization of population vectors using the opposite point procedure, self-adaptive control approach by node mutation rate, crossover rate, node capacity and cluster head allocation Methods. Findings: A case study in the proposed work is found to be better in throughput, accuracy, efficiency, energy utilization, batteries recharge ability and replacement procedures compared to the conventional methods. By the analysis and comparison of the proposed method with existing methods, it is identified that the reduction of the number of dead nodes gradually increases the throughput and lifetime of the nodes with respect to the number of iterations. Novelty: To overcome the limitations of conventional Low Energy Adaptive Clustering Hierarchy (LEACH), harmony search algorithm (HSA), modified HSA and differential evolution, we propose a hybrid optimal model using simulated annealing algorithm which includes a node capability function. It is used to improve the network lifetime of the cluster heads and sensor nodes. The proposed method have capability of batteries recharge ability and replacement option to improve network throughput and reliability of network.

show abstract

Privacy Enhancement for Wireless Sensor Networks and the Internet of Things Based on Cryptological Techniques

Karthiga,

Indirani,

Sankarananth

et al. 2023

Wireless Communication for Cybersecurity

View full text Add to dashboard Cite

A New Key Management Scheme for Wireless Sensor Networks using an Elliptic Curve

Cited by 13 publications

References 6 publications

An efficient cryptographic technique using modified Diffie–Hellman in wireless sensor networks

An efficient cryptographic technique using modified Diffie–Hellman in wireless sensor networks

An efficient hybrid model for cluster head selection to optimize wireless sensor network using simulated annealing algorithm

Privacy Enhancement for Wireless Sensor Networks and the Internet of Things Based on Cryptological Techniques

Contact Info

Product

Resources

About