Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 201

The DOI matches its Crossref record.

Computationally efficient privacy preserving anonymous mutual and batch authentication schemes for vehicular ad hoc networks

Vijayakumar, P., Chang, Victor, Jegatha Deborah, L., Balusamy, Balamurugan, Shynu, P.G.·2018·Future Generation Computer Systems

Abstract

In the near future, it is envisioned that vehicular Ad hoc networks (VANETs) will be making use of long-distance communication techniques, such as cellular networks and Worldwide Interoperability for Microwave Access (WiMAX), to get instant Internet access for making the communication between vehicles and fixed road side infrastructure. Moreover, VANETs will also make use of short-distance communication methods, such as Dedicated Short-Range Communications (DSRC) and Wireless Fidelity (Wi-Fi) to perform short range communication between vehicles in an ad hoc manner. This Internet connection can provide facility to other vehicles to send traffic related messages, collisions, infotainment messages other useful safety alerts. In such a scenario, providing authentication between vehicle to infrastructure and vehicle to vehicle is a challenging task. In order to provide this facility, in this paper, we propose a computationally efficient privacy preserving anonymous authentication scheme based on the use of anonymous certificates and signatures for VANETs in making them an important component of Internet of Things (IoT) and the development of smart cities. Even though there are several existing schemes available to provide such anonymous authentication based on anonymous certificates and signatures in VANETs, the existing schemes suffer from high computational cost in the certificate revocation list (CRL) checking process and in the certificate and the signature verification process. Therefore, it is not possible to meet the requirement of verifying a large number of messages per second in VANETs which would lead to increased message loss. Hence, we use a computationally efficient anonymous mutual authentication scheme to validate the message source as well as to ensure the integrity of messages along with a conditional tracking mechanism to trace the real identity of misbehaving vehicles and revoke them from VANET in the case of dispute. In this paper, we also introduce an efficient anonymous batch authentication protocol to be used in IoT for Road Side Units (RSUs) to authenticate multiple vehicles simultaneously rather than one after the other such that the total authentication time can be dramatically reduced. This proposed scheme is implemented and the performance analysis shows that our scheme is more efficient in terms of certificate and signature verification cost, while preserving conditional privacy in VANETs.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.future.2016.11.024

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 201

Metadata

Authors
Vijayakumar, P., Chang, V., Jegatha Deborah, L., Balusamy, B., & Shynu, P. G.
Venue
Future Generation Computer Systems
Publisher
Elsevier BV
Published
2018-01
Volume
78
Pages
943-955
ISSN
0167-739X (ISSN-L)
OpenAlex
W2558465299
Cited by
201
References
0
FWCI
8.54
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Computationally efficient privacy preserving anonymous mutual and batch authentication schemes for vehicular ad hoc networks. https://app.cochat.ai/papers/10.1016/j.future.2016.11.024
The paper
Vijayakumar, P., Chang, V., Jegatha Deborah, L., Balusamy, B., & Shynu, P. G. (2018). Computationally efficient privacy preserving anonymous mutual and batch authentication schemes for vehicular ad hoc networks. Future Generation Computer Systems. https://doi.org/10.1016/j.future.2016.11.024

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.