Certificateless aggregate signcryption scheme with multi-ciphertext equality test for the internet of vehicles

The Internet of Vehicles (IoV) facilitates connectivity among vehicles, roadside units, and smart terminals, enabling the evolution of traditional traffic networks into intelligent transport systems. The IoV has an open communication character, which enables various applications and services. However, this also exposes it to the risk of message tampering or the leaking of private data in the communication process. Such vulnerabilities may lead to security issues. At present, there are many solutions to solve the above problems, but most of them have great computational and communication overhead. Multi-ciphertext equality test can compare the equality between two ciphertexts without decryption, which avoids the user 's repeated decryption of the same ciphertext to a certain extent. However, it still has a large computational overhead. For the above problems, we propose a certificateless aggregate signcryption scheme for the IoV that supports multi-ciphertext equality testing. The proposed scheme addresses the key escrow and certificate management issues inherent in identity-based systems by employing a certificateless signcryption mechanism. To prevent redundant retrieval of ciphertexts that correspond to identical plaintexts, a multi-ciphertext equivalence test feature has been incorporated. Furthermore, the aggregation capability of this scheme significantly enhances the efficiency of signing multiple vehicle data entries. By leveraging the computational complexities associated with the Diffie-Hellman problem and the discrete logarithm problem, it is demonstrated that the scheme maintains confidentiality and unforgeability within the random oracle model. When compared to similar schemes, this approach exhibits reduced computational overhead while providing superior security features.

Authors

Institutions

Publication Details

Journal
PLoS ONE
Published
2025-05-27
DOI
https://doi.org/10.1371/journal.pone.0322185
Citations
2
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
4.96

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Certificateless aggregate signcryption scheme with multi-ciphertext equality test for the internet of vehicles

Ke Yao, Ruixia Liu, Xiaodong Yang, Songyu Li et al.
2 citations
PLoS ONE
Cryptography and Data Security
4.96
article

Certificateless aggregate signcryption scheme with multi-ciphertext equality test for the internet of vehicles

Ke Yao, Ruixia Liu, Xiaodong Yang, Songyu Li, Xinxin Luo
article en
2 citations

Abstract

The Internet of Vehicles (IoV) facilitates connectivity among vehicles, roadside units, and smart terminals, enabling the evolution of traditional traffic networks into intelligent transport systems. The IoV has an open communication character, which enables various applications and services. However, this also exposes it to the risk of message tampering or the leaking of private data in the communication process. Such vulnerabilities may lead to security issues. At present, there are many solutions to solve the above problems, but most of them have great computational and communication overhead. Multi-ciphertext equality test can compare the equality between two ciphertexts without decryption, which avoids the user 's repeated decryption of the same ciphertext to a certain extent. However, it still has a large computational overhead. For the above problems, we propose a certificateless aggregate signcryption scheme for the IoV that supports multi-ciphertext equality testing. The proposed scheme addresses the key escrow and certificate management issues inherent in identity-based systems by employing a certificateless signcryption mechanism. To prevent redundant retrieval of ciphertexts that correspond to identical plaintexts, a multi-ciphertext equivalence test feature has been incorporated. Furthermore, the aggregation capability of this scheme significantly enhances the efficiency of signing multiple vehicle data entries. By leveraging the computational complexities associated with the Diffie-Hellman problem and the discrete logarithm problem, it is demonstrated that the scheme maintains confidentiality and unforgeability within the random oracle model. When compared to similar schemes, this approach exhibits reduced computational overhead while providing superior security features.

PLoS ONEVol. 20(5)
Northwest Normal University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 5%
Cryptography and Data Security
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.