CoChat

An efficient certificateless aggregate signature without pairings for vehicular ad hoc networks

Cui, Jie, Zhang, Jing, Zhong, Hong, Shi, Runhua, Xu, Yan · 2018 · Information Sciences
Cited by 178

The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.

Abstract

In order to eliminate the complexity associated with managing public key encryption certificates and the drawbacks of identity-based encryption key escrows, the concept of certificateless public key cryptography has been recommended. Further, in specific application areas where the signatures on numerous messages generated by different users need to be compressed, the concept of the aggregate signature is useful. An aggregate signature can not only reduce the cost of verification, but also reduce the length of the signature, which makes it effective in environments constrained by bandwidth and storage. In this paper, we propose a new, efficient, certificateless aggregate signature based on the elliptic curve cryptosystem (ECC), and demonstrate its ability to support conditional privacy preservation. This scheme demonstrates the process of secure communication between vehicles and the infrastructure in vehicular ad hoc networks (VANETs). The proposed scheme not only satisfies privacy requirements (with security analysis), but also achieves lower message overhead than previous schemes. We demonstrate that the performance of our scheme surpasses that of existing authentication schemes for VANETs in terms of computation and communication costs.

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.

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

Integrity signals

Registry

Crossref · 10.1016/j.ins.2018.03.060

Cites

33 of 33 references verified0 citation errors · 0 not checkable

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.

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

Cites

Show all 33 references

Cited by

Metadata

Authors
Cui, J., Zhang, J., Zhong, H., Shi, R., & Xu, Y.
Venue
Information Sciences
Publisher
Elsevier BV
Published
2018-07
Volume
451-452
Pages
1-15
ISSN
0020-0255 (ISSN-L)
OpenAlex
W2794799331
Cited by
178
References
33
FWCI
10.18
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

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.