2018
DOI: 10.1109/access.2018.2845464
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Pairing-Free Certificateless Authentication Scheme With Batch Verification for Vehicular Ad-Hoc Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
71
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 87 publications
(71 citation statements)
references
References 32 publications
0
71
0
Order By: Relevance
“…1 + 2. for the improved MLGS. Since the cost of pairing evaluation is more expensive compared to scalar multiplication [30], we see that the computational cost for our work is better than GSIS and more costly efficient compared to TAA as our work has the least pairing operation compared to others. Our work requires two pairings, while GSIS and TAA require three and five pairings respectively.…”
Section: Computational Cost and Computation Timementioning
confidence: 90%
“…1 + 2. for the improved MLGS. Since the cost of pairing evaluation is more expensive compared to scalar multiplication [30], we see that the computational cost for our work is better than GSIS and more costly efficient compared to TAA as our work has the least pairing operation compared to others. Our work requires two pairings, while GSIS and TAA require three and five pairings respectively.…”
Section: Computational Cost and Computation Timementioning
confidence: 90%
“…In order to assure secure communication in VANETs, different approaches [33] have been discussed in the literature. In this context, Gayathri et al [34] presents a pairing-free, certificateless authentication scheme that uses batch verification, while [35] introduces an identity-based fault-tolerant batch verification. In [36] the solution is based on a password-based conditional privacy preserving authentication and group-key generation protocol.…”
Section: Related Workmentioning
confidence: 99%
“…Compared with the above operations, the calculation cost of T h , T pa and T RSAv can be omitted according to [31], [32], and according to [38], the computational overhead of RSA encryption is the same as that of RSA verification. In addition, by summarizing the experimental results and conclusions from [33]- [35], we can obtain the following relationships of the execution time(ms) of the operations, as in (2)- (6).…”
Section: A Anonymous Identity Authentication Efficiencymentioning
confidence: 99%