
Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/18732
Title: | Secure message communication protocol among vehicles in smart city |
Authors: | Dua, Amit |
Keywords: | Computer Science Authentication Burrows–Abadi–Needham (BAN) logic Smart City Formal security |
Issue Date: | May-2018 |
Publisher: | IEEE |
Abstract: | Secure messages exchange among different vehicles is one of the most challenging tasks in future smart cities. Any malicious activity has the potential to compromise the confidentiality, integrity, and authenticity of messages exchanged between different vehicles. To ensure secure message communication among the vehicles in a smart city environment, a novel scheme using elliptic curve cryptographic (ECC) technique has been presented in this paper. For this purpose, a two-level authentication key exchange scheme has been designed. In the first level authentication, CH s are verified by series of messages exchanged between CHs and the CA. The verified CHs are responsible for authentication of vehicles in the second level authentication, followed by exchange of messages between CH and vehicle. The security analysis using widely accepted Burrows-Abadi-Needham logic, formal security analysis using random oracle model and verification using the widely known automated validation of Internet security protocols and applications (AVISPA) tool, and also the informal security analysis have been done with respect to various types of attacks. Moreover, a comparative analysis of the proposed scheme with existing related schemes reveals that it generates low overhead and latency, and high reliability during messages exchange between vehicles and the CA. |
URI: | https://ieeexplore.ieee.org/document/8187745 http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/18732 |
Appears in Collections: | Department of Computer Science and Information Systems |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.