ArticlePloS one2025
Certificateless aggregate signcryption scheme with multi-ciphertext equality test for the internet of vehicles.
Article in PloS one, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
1 citing paper in PubMed.
- Empowering IoV Security: A Novel Secure Cryptographic Algorithm (OpCKEE) for Network Protection in Connected Vehicles.Sensors (Basel, Switzerland) · 2026Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
No grant is acknowledged in the PubMed record.
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.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.