z-logo
open-access-imgOpen Access
An Efficient Revocation Scheme for Vehicular Ad-Hoc Networks
Author(s) -
Arwa Alrawais,
Abdulrahman Alhothaily,
Bo Mei,
Tianyi Song,
Xiaolu Cheng
Publication year - 2018
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2018.03.081
Subject(s) - revocation list , computer science , merkle tree , revocation , computer network , scalability , hash function , overhead (engineering) , vehicular ad hoc network , dissemination , certificate , wireless ad hoc network , computer security , certificate authority , distributed computing , hash chain , public key cryptography , wireless , database , algorithm , telecommunications , encryption , operating system
In Vehicular Ad-Hoc Networks (VANETs), the distribution of certificate revocation information is a security issue to provide safety and efficiency in the transportation system. Most of the current approaches are based on distributing a Certificate Revocation List (CRL) that incurs a large communication overhead, storage space, and checking time. In this work, we propose an efficient revocation scheme based on the use of fog computing and Merkle hash trees replacing the time consuming CRL checking process. More specifically, we divide the roadway into several domains, in which fog nodes manage the vehicles in a localized manner. Then, we utilize Merkle hash trees to provide a highly scalable way to disseminate the revocation information and ensure the integrity of the certificate’s status. The performance analysis is carried out to demonstrate the effectiveness of our scheme in terms of verification delay compared with the conventional mechanisms.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom