2011
DOI: 10.1109/tits.2011.2156790
|View full text |Cite
|
Sign up to set email alerts
|

PACP: An Efficient Pseudonymous Authentication-Based Conditional Privacy Protocol for VANETs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
109
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 211 publications
(116 citation statements)
references
References 18 publications
0
109
0
Order By: Relevance
“…Therefore it takes more time for verification. In [5] provides conditional privacy preservation. In this scheme the vehicles use pseudonyms to communicate with the RSU, which ensure privacy to the users.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Therefore it takes more time for verification. In [5] provides conditional privacy preservation. In this scheme the vehicles use pseudonyms to communicate with the RSU, which ensure privacy to the users.…”
Section: Related Workmentioning
confidence: 99%
“…In the recent years, various authors have proposed privacy preserving authentication schemes for secure message communication. The two most common privacy preserving authentication schemes are the pseudonyms based privacy preserving scheme [4][5][6][7][8][9][10][11][12]22, 24], the group signature based privacy preserving scheme [13][14][15][16][17]. Each scheme provides solution to the secure privacy preserving message communication problems in VANET but all of them have some drawbacks.…”
Section: Introductionmentioning
confidence: 99%
“…PACP does not rely on storing multiple pseudonym certificates issued from a centralized authority or on providing identity certificates to the RSU for generating on-the-fly pseudonym certificates. Instead, a node generates its pseudonyms with assistance from the RSU in its neighborhood in a way that the RSU gains no information about the node's real identity may increase computational cost [5]. Genetic algorithm is used to find the optimal path from source and destination node [12].…”
Section: Related Workmentioning
confidence: 99%
“…A majority of these schemes make use of pseudonyms (e.g. [4,24,13]) or anonymous credentials (e.g. [9,12]).…”
Section: Related Workmentioning
confidence: 99%
“…Otherwise, one may send some wrong messages or pretend others to send messages. There are many schemes in the literature (such as [24,15,14,23]) that deal with these two seeming contradictory requirements.…”
Section: Introductionmentioning
confidence: 99%