2018
DOI: 10.1016/j.ins.2018.03.060
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
123
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 107 publications
(123 citation statements)
references
References 32 publications
0
123
0
Order By: Relevance
“…Hence, the cost of computation is 3 × 2.5313 + 0.0217 + 2 × 0.0007 = 7.6170 ms. The computation cost of the Verify and Aggregate Verify algorithms of the proposed scheme and are the same. In Reference , a verifier executes three point multiplication, two point addition, and two map‐to‐point hash function operations.…”
Section: Security Analysis and Performance Evaluationmentioning
confidence: 99%
See 2 more Smart Citations
“…Hence, the cost of computation is 3 × 2.5313 + 0.0217 + 2 × 0.0007 = 7.6170 ms. The computation cost of the Verify and Aggregate Verify algorithms of the proposed scheme and are the same. In Reference , a verifier executes three point multiplication, two point addition, and two map‐to‐point hash function operations.…”
Section: Security Analysis and Performance Evaluationmentioning
confidence: 99%
“…Communication among vehicles, and between an RSU and an OBU is referred to as vehicle‐to‐vehicle (V2V) and is achieved using a dedicated short‐range communication (DSRC) protocol; while the TA, RSUs, and an application server (AS) communicate using a secure wired channel such as the Internet . According to VANET requirements, by using the DSRC protocol, each OBU frequently broadcasts traffic‐related information every 100‐300 ms . RSUs can collect traffic‐related data from OBUs, verify their authenticity and integrity, and then transmit the valid data to the AS for analysis.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Computation cost is an important index to analyze the performance of a scheme . In our scheme and other schemes, they mainly use the operation of bilinear pairings and the exponential operations on the group.…”
Section: Performance Analysismentioning
confidence: 99%
“…Computation cost is an important index to analyze the performance of a scheme. [32][33][34] In our scheme and other schemes, they mainly use the operation of bilinear pairings and the exponential operations on the group. So T par denotes the time of a bilinear pairing operation and T exp denotes the time of exponentiation operation on the cyclic groups G 1 ,G 2 .…”
Section: Computation Costmentioning
confidence: 99%