Cited by 11Vehicular Ad Hoc Networks (VANETs)Blockchain Technology Applications and SecurityCryptography and Data Security

A Trusted Data Privacy Computing Method for Vehicular Ad Hoc Networks Based on Homomorphic Encryption and DAG Blockchain

Jiang, Wenxian, Tao, Jun, Guan, Zhenglei·2025·IEEE Internet of Things Journal

Abstract

Recently, vehicular ad hoc networks (VANETs) have garnered significant attention in the industry, thanks to their distinctive characteristics of mobility and real-time capabilities. In order to protect the privacy of data sharing in VANETs, a privacy computing scheme based on homomorphic encryption and blockchain has been proposed. First, the Paillier algorithm of homomorphic encryption is used to encrypt the data, making it available but not invisible to ensure the security of the data. Second, the data structure of a directed acyclic graph (DAG) is applied to replace the chain structure so that it can be processed in parallel and reduce the delay time of transmission confirmation. Finally, a single point cluster is set up in the Bigchain database, and Docker virtual technology is used to simulate the high dynamic and high load environment of VANETs, so as to verify the computational efficiency and security of the proposed scheme. The experimental results show that the privacy computing scheme combining homomorphic encryption and DAG blockchain not only eliminates the need for repeated encryption and decryption in the communication process but also reduces the computational cost associated with private data. Compared with traditional chain blockchain, this scheme achieves a comprehensive delay reduction of 68.51% and shortens the average confirmation time by 85.73%, effectively meeting the high-performance requirements of VANETs.

Integrity signals

Registry

Crossref · 10.1109/jiot.2024.3492031

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

1 of the 20 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Jiang, W., Tao, J., & Guan, Z.
Affiliations
  • Southeast University (CN)
  • Huaqiao University (CN)
Venue
IEEE Internet of Things Journal
Published
2025-03-15
Volume
12
Issue
6
Pages
6621-6632
ISSN
  • 2327-4662 (ISSN-L)
  • 2372-2541
OpenAlex
W4404056776
Cited by
9
References
20
Citations by year
2026: 6 · 2025: 3
FWCI
0.93
Type
journal article
Language
en
Open access
closed
Locations
IEEE Internet of Things Journal (publishedVersion)
Funders
National Natural Science Foundation of China (62372190)
Topics
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Vehicular Ad Hoc Networks (VANETs)
  • Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
Keywords
vehicular ad hoc networks, data privacy, homomorphic encryption, Paillier cryptosystem, blockchain

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