2018
DOI: 10.1007/s00607-018-0689-3
|View full text |Cite
|
Sign up to set email alerts
|

An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
45
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 42 publications
(45 citation statements)
references
References 44 publications
0
45
0
Order By: Relevance
“…(1), (2) and 3are not valid at this stage. When a neighbor vehicle satisfies all the required conditions (1), (2) and 3, then it will be considered in the FV selection method by the source vehicle.…”
Section: Elimination Of the Unnecessary Neighbor Vehicles From The Nementioning
confidence: 93%
See 1 more Smart Citation
“…(1), (2) and 3are not valid at this stage. When a neighbor vehicle satisfies all the required conditions (1), (2) and 3, then it will be considered in the FV selection method by the source vehicle.…”
Section: Elimination Of the Unnecessary Neighbor Vehicles From The Nementioning
confidence: 93%
“…Due to the unique characteristics and attractive features of VANET like decentralized administration and self-organizing power, it has found widespread usage in autonomous driving systems, health care services [1], parking slots management, advertising products for marketing purposes and online gaming. To improve the traffic security [2], the bulk amount of traffic information has been circulated through the VANET. For privacy-preserving and duplicate address detection purposes [3,4], VANET is extensively useful in a dynamic environment.…”
Section: Introductionmentioning
confidence: 99%
“…Moreover, the schemes of Shim and He et al are not resistant against quantum computing. Furthermore, the scheme of Mukherjee et al is quantum attack resistant, but it stores password and secret directly in temper‐proof device.…”
Section: Performance Analysismentioning
confidence: 99%
“…Furthermore, the scheme of Liu et al takes m ( n +1) t m + m ( t a +3 t h ) cost for a signature generation on a message, n ( m +1) t m + n ( t a + t h ) cost for verification of a message, and (2 n + m )( ℓ −1) t a + ℓt h + ℓt m cost for batch verification of ℓ messages. Further, the scheme of Mukherjee et al takes m ( n +1) t m + m ( t a +3 t h ) cost for a signature generation on a message, n ( m +1) t m + n ( t a + t h ) cost for verification of a message, and (2 n + m )( ℓ −1) t a +2 ℓt h + ℓt m cost for batch verification of ℓ messages. Finally, the proposed LCPPA scheme takes m ( n +1) t m + m ( t a +3 t h ) cost for a signature generation on a message, n ( m +1) t m + n ( t a + t h ) cost for verification of a message, and (2 n + m )( ℓ −1) t a + ℓt h + ℓt m cost for batch verification of ℓ messages (for comparison of total cost in batch verification, see Figure ).…”
Section: Performance Analysismentioning
confidence: 99%
See 1 more Smart Citation