A Computationally Efficient Pairing-Free Group Key Distribution Scheme for Vehicular Ad-Hoc Network

Abstract

The Vehicular Ad-hoc Network (VANET) is vulnerable to multiple attacks such as brute force attack, malicious users, and malicious nodes due to the lack of authentication between vehicles., and as a result, attackers could perform malicious intrusion in any vulnerable VANET. This paper presentes an efficiently computational identity based pairing-free group key distribution scheme to enhance the authentication between vehicles and hence the V ANETs can overcome the multiple attacks. When comparing the proposed scheme with other previously proposed, our proposed scheme provides less computational cost and better performance in secure group key communication. A Mathematica code program is done for the proposed scheme.