A Lightweight Authenticated Key Agreement Protocol Using Fog Nodes in Social Internet of Vehicles

Abstract

Recently, there has been rapid growth in the Internet of things, the Internet of vehicles, fog computing, and social Internet of vehicles <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" id="M1"> <a:mfenced open="(" close=")" separators="|"> <a:mrow> <a:mtext>SIoV</a:mtext> </a:mrow> </a:mfenced> </a:math> , which can generate large amounts of real-time data. Now, researchers have begun applying fog computing to the <f:math xmlns:f="http://www.w3.org/1998/Math/MathML" id="M2"> <f:mtext>SIoV</f:mtext> </f:math> to reduce the computing pressure on cloud servers. However, there are still security challenges in <h:math xmlns:h="http://www.w3.org/1998/Math/MathML" id="M3"> <h:mtext>SIoV</h:mtext> </h:math> . In this paper, we propose a lightweight and authenticated key agreement protocol based on fog nodes in <j:math xmlns:j="http://www.w3.org/1998/Math/MathML" id="M4"> <j:mtext>SIoV</j:mtext> </j:math> . The protocol completes the mutual authentication between entities and generates the session key for subsequent communication. Through a formal analysis of the Burrows–Abadi–Needham (BAN) logic, real-oracle random (ROR) model, and ProVerif, the security, validity, and correctness of the proposed protocol are demonstrated. In addition, informal security analysis shows that our proposed protocol can resist known security attacks. We also evaluate the performance of the proposed protocol and show that it achieves better performance in terms of computing power and communication cost.