An Efficient and Provably Secure ECC-Based Conditional Privacy-Preserving Authentication for Vehicle-to-Vehicle Communication in VANETs
The DOI matches its Crossref record.
Abstract
In vehicular ad-hoc networks (VANETs), safety messages are exchanged among vehicles and between vehicles and infrastructure to ensure passengers' safety and efficiency in traffic. The source authentication as well as integrity checking of these messages are very necessary for a receiver. Based on certificateless cryptography (CLC), some state-of-the-art signature schemes have been proposed to address these. Although they fulfill the requirements of authentication and privacy, they are not efficient with respect to performance. Bilinear pairings and map-to-point hash functions are used in these schemes. These require a huge amount of time to process. The computational power and storing capacity of an on-board unit (OBU) in each vehicle are limited. Therefore, computational overhead is induced on vehicles that need to authenticate messages in areas of high traffic density. In this paper, a provably secure and efficient certificateless short signature-based conditional privacy-preserving authentication (CLSS-CPPA) scheme for V2V communication is designed. This scheme does not use bilinear parings and is based on the elliptic curve cryptosystem (ECC). In addition, instead of map-to-point hash functions, general hash functions are used. Furthermore, the CLSS-CPPA scheme supports the batch signature verification method which allows multiple signatures to be verified simultaneously and efficiently. The CLSS-CPPA scheme ensures security against type-I and type-II attackers with respect to existential unforgeability against adaptively chosen message attacks (EUF-CMA) under a hardness assumption of the elliptic curve discrete logarithm problem (ECDLP) in the random oracle model (ROM). The proposed scheme significantly improves performance in terms of computational and communication costs in comparison with state-of-the-art schemes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Anonymity-enhanced Sequential Multi-signer Ring Signature for Secure Medical Data Sharing in IoMT
Xu, G., Fan, X., Xu, S., Cao, Y., Chen, X.-B., Shang, T., & Yu, S. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3574959 · Cited by 74
“Definition 3 [50]: For any PPT algorithm A , there exists a negligible function ε such that Adv ECDLP A , G q ( k ) ≤ ε ( k ).”
Privacy-Preservation Techniques for IoT Devices: A Systematic Mapping Study
Torre, D., Chennamaneni, A., & Rodriguez, A. (2023) · IEEE Access · doi:10.1109/access.2023.3245524 · Cited by 35
Cheng, T., Liu, Q., Shi, Q., Yang, Z., Wang, C., Zhang, X., & Xu, P. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3384993 · Cited by 23
“Compared to large-number factorization, elliptic curve algorithms based on the discrete logarithm problem provide significant computational improvements [12], [13], [14].”
Method
Metadata
- Authors
- Ali, I., Chen, Y., Ullah, N., Kumar, R., & He, W.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2021-02
- Volume
- 70
- Issue
- 2
- Pages
- 1278-1291
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W3120179717
- Cited by
- 170
- References
- 0
- FWCI
- 7.85
- 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: An Efficient and Provably Secure ECC-Based Conditional Privacy-Preserving Authentication for Vehicle-to-Vehicle Communication in VANETs. https://app.cochat.ai/papers/10.1109/tvt.2021.3050399
- The paper
- Ali, I., Chen, Y., Ullah, N., Kumar, R., & He, W. (2021). An Efficient and Provably Secure ECC-Based Conditional Privacy-Preserving Authentication for Vehicle-to-Vehicle Communication in VANETs. IEEE Transactions on Vehicular Technology. https://doi.org/10.1109/tvt.2021.3050399
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.