Key Agreement Protocol Based On EC-MQV Algorithm for Cooperative Wireless Communication
نویسنده
چکیده
In wireless communication user cooperation is important because in wireless communication number of nodes is available in the network. It is seen that in normal wireless communication the performance is not good as compare to the cooperative communication, where cooperation among multiple nodes presents in the network and hence it is the topic of interest for most of the researchers. Although some of the wireless communication system is not uses cooperative, nature of communication and may cause a performance reduction since the node not trusted or it may prone to some of the attacks. To solve these issues in the wireless communication where number of nodes presents in the network, a simulation model is proposed based on Elliptic Curve Manezes Qu Vanstone algorithm (EC-MQV). In the proposed work the comparison between simple wireless communication and cooperative wireless communication is presented. The work used EC-MQV algorithm further to support the security of existing key agreement protocol. It is found that used of Elliptic curve also helps to improve the efficiency of the network.
منابع مشابه
An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملMaking the Diffie-Hellman Protocol Identity-Based
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and receives his secret key from a master Key Generation Center, whose public parameters are publicly known. The novelty of our protocol is that it can be implemented over any cyclic group of prime order, where the Diffie-Hel...
متن کاملProvably secure and efficient identity-based key agreement protocol for independent PKGs using ECC
Key agreement protocols are essential for secure communications in open and distributed environments. Recently, identity-based key agreement protocols have been increasingly researched because of the simplicity of public key management. The basic idea behind an identity-based cryptosystem is that a public key is the identity (an arbitrary string) of a user, and the corresponding private key is ...
متن کاملMulti-party authenticated key agreement protocols from multi-linear forms
Joux [10] presented a one round protocol for tripartitie key agreement and Al-Riyami et.al. [15] developed a number of tripartitie, one round, authenticated protocols related to MTI and MQV protocols. Recently, Boneh and Silverleg [4] studied multilinear forms, which provides a one round multi-party key agreement protocol. In this paper, we propose (n + 1) types of one round authenticated multi...
متن کاملObtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS
LaMacchia, Lauter and Mityagin recently presented a strong security definition for authenticated key agreement strengthening the well-known Canetti-Krawczyk definition. They also described a protocol, called NAXOS, that enjoys a simple security proof in the new model. Compared to MQV and HMQV, NAXOS is less efficient and cannot be readily modified to obtain a one-pass protocol. On the other han...
متن کامل