2008
DOI: 10.1007/s11390-008-9194-z
|View full text |Cite
|
Sign up to set email alerts
|

Probabilistic Adaptive Anonymous Authentication in Vehicular Networks

Abstract: Vehicular networks have attracted extensive attention in recent years for their promises in improving safety and enabling other value-added services. Most previous work focuses on designing the media access and physical layer protocols. Privacy issues in vehicular systems have not been well addressed. We argue that privacy is a user-specific concept, and a good privacy protection mechanism should allow users to select the levels of privacy they wish to have. To address this requirement, we propose an adaptive … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(18 citation statements)
references
References 21 publications
0
18
0
Order By: Relevance
“…Such policy threatens anonymity and may prevent drivers from joining the service. On the other hand, the recent work of [21] provides unconditional anonymity in the sense that it is impossible to trace the identity of any OBU. The protocol requires four interactive rounds between the OBU and the RSU in order to establish a session key which will be used for all data transmission during the session.…”
Section: Previous and Related Workmentioning
confidence: 99%
“…Such policy threatens anonymity and may prevent drivers from joining the service. On the other hand, the recent work of [21] provides unconditional anonymity in the sense that it is impossible to trace the identity of any OBU. The protocol requires four interactive rounds between the OBU and the RSU in order to establish a session key which will be used for all data transmission during the session.…”
Section: Previous and Related Workmentioning
confidence: 99%
“…RSU constructs the verifiable common secret for the group members with a random value x, its current time T 2 , its current group version V G , and the signature P ri s (H) obtained through encrypting the digest message (MAC) of GP ub(x) using hash function H with its private key P ri s , and server probe [3] information if a rational RSU using server probing tradeoff OBU probabilistic verification. (e.g., OBU can tolerate RSU server probing.…”
Section: B Protocol Descriptionmentioning
confidence: 99%
“…From anonymity authentication in dynamic group [1] to VANET, protocol extension [2] is based on k-anonymity model, and OBU customizes its anonymity group size which is userspecific, also called adaptive. In further protocol extension [3], OBU can do probabilistic verification to save computation cost. However, previous protocols reflects privacy in VANET limited by the pitfall of k-anonymity model.…”
Section: Data Privacy In Vanetmentioning
confidence: 99%
See 2 more Smart Citations