Pre-Distribution of Certificates for Pseudonymous Broadcast Authentication in VANET

Feiri, Michael; Pielage, Rolf; Petit, Johann; Zannone, Nicola; Kargl, Frank

doi:10.1109/vtcspring.2015.7146029

Cited by 9 publications

(4 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, Sun et al [21] proposed a certificate update method using roadside units (RSUs), but that method depends on communication infrastructures, which makes it unsuitable for disaster communication systems because it is highly probable that RSUs will be unavailable in emergency situations. Separately, Feiri et al [22] proposed a vehiclebased certificate distribution method that forces vehicles in close proximity to each other to proactively exchange certificates. However, Feiri's method would not work in low-vehicle-density areas where vehicles rarely encounter each other because the need to encounter other vehicles to keep certificates updated would degrade disaster communication systems.…”

Section: B Individual Authentication On Vehicular Networkmentioning

confidence: 99%

Link Setup Time Reduction by FILS on IEEE 802.11-Based Inter-Vehicular Communications

Kato

Maeno²,

Owada

et al. 2021

IEEE Access

View full text Add to dashboard Cite

Section: B Individual Authentication On Vehicular Networkmentioning

confidence: 99%

Link Setup Time Reduction by FILS on IEEE 802.11-Based Inter-Vehicular Communications

Kato

Maeno²,

Owada

et al. 2021

IEEE Access

View full text Add to dashboard Cite

“…Cluster head nodes are make clusters to existing vehicles node have to broadcast pseudonyms certificate to achieve higher VPL. Our this work, we propose VPL x to denote the level of vehicle node x,(x = 1,2,….,n) to the number of the vehicle nodes to CH …”

Section: Proposed Workmentioning

confidence: 99%

“…Our this work, we propose VPL x to denote the level of vehicle node x,(x = 1,2,….,n) to the number of the vehicle nodes to CH. [46][47][48][49][50][51][52][53] The pseudonyms changing vehicle node obviously consider distance and traffic from other vehicle nodes to CH by way of it or not. Pseudonyms changing of node x is P x , PC is for the number of the pseudonyms changing vehicle to transfer their traffic information by way of distance to the CH, then the pseudonyms changing of node x is calculated by…”

Section: Clustering Protocolsmentioning

confidence: 99%

Distance and clustering‐based energy‐efficient pseudonyms changing strategy over road network

Memon

2018

Int J Communication

View full text Add to dashboard Cite

Summary To improve the fairness, the energy consumption changing pseudonyms needs to be taken into account. Existing works focus on changing velocity‐based pseudonyms changing strategy and short changes interval with limited coverage, but due to similar velocity and short changes, internal attacker guesses easily known communication and location information due to location information of vehicle on tracking, which may expose adversary private information, and frequently, pseudonyms changing occurs due to movement of vehicles' similar velocity and short coverage, which may cause serious attack of vehicle. To overcome this problem, distance and cluster can be performed. In this work, we proposed distance and cluster‐based energy pseudonyms changing method for road network. We proposed distance and energy‐based clustering routing service over road network, the cluster head elected to depend on random number of distance and energy to change pseudonyms of vehicles. An each interval to be establish cluster head vehicle deployed while selects the operation mode and informs the cluster members of the selected mode through beacon signal. The cluster head vehicle node performs the pseudonyms changing based on the predicted distance and energy of the cluster member to use clustering optimization. The data of whole network send to report server through these nodes while near the RSU, and the vehicles in this area will use less energy to change the pseudonyms. The simulation results show that the proposed method enhances pseudonyms changing strategy less consumption and delays sufficient privacy level each vehicle also our method has outperform compare with existing methods than we use Sumo simulation and Matlab tools to verify our proposed method. Our proposed method outperformed in terms of pseudonym changing energy efficiency to careful attention during the cluster formation process, stable and balanced clusters that prolong the network lifetime, increases distances to more CH vehicles connectivity to makes clustering group and changing their pseudonyms in terms of high level privacy and finally, CH nodes use Dijkstra's algorithm use MST among the vehicles nodes depend on existing road networks to follow shortest path selection roads in terms of high connectivity probability of CH and stable structure of the network decreases the topology changes and thus,the clustering overhead is reduced.

show abstract

“…The scheme is highly efficient in terms of the delays involved in signature and certificate verification; however, it maintains conditional privacy. For an anonymous certificate, in order to reduce communication overhead and to minimize cryptographic packet loss, Feiri et al [10] combined certificate pre-distribution and certificate omission in order to reduce communications overhead and minimize cryptographic packet loss. Although the use of anonymous certificates is able to achieve the purpose of privacy protection, it needs further investigation to overcome weaknesses in certificate distribution and revocation, and numerous problems with certificate storage.…”

Section: Introductionmentioning

confidence: 99%

Lattice-based double-authentication-preventing ring signature for security and privacy in vehicular Ad-Hoc networks

Liu

Jia

et al. 2019

Tinshhua Sci. Technol.

View full text Add to dashboard Cite

Amidst the rapid development of the Internet of Things (IoT), Vehicular Ad-Hoc NETwork (VANET), a typical IoT application, are bringing an ever-larger number of intelligent and convenient services to the daily lives of individuals. However, there remain challenges for VANETs in preserving privacy and security. In this paper, we propose the first lattice-based Double-Authentication-Preventing Ring Signature (DAPRS) and adopt it to propose a novel privacy-preserving authentication scheme for VANETs, offering the potential for security against quantum computers. The new construction is proven secure against chosen message attacks. Our scheme is more efficient than other ring signature in terms of the time cost of the message signing phase and verification phase, and also in terms of signature length. Analyses of security and efficiency demonstrate that our proposed scheme is provably secure and efficient in the application.

show abstract

Pre-Distribution of Certificates for Pseudonymous Broadcast Authentication in VANET

Cited by 9 publications

References 22 publications

Link Setup Time Reduction by FILS on IEEE 802.11-Based Inter-Vehicular Communications

Link Setup Time Reduction by FILS on IEEE 802.11-Based Inter-Vehicular Communications

Distance and clustering‐based energy‐efficient pseudonyms changing strategy over road network

Lattice-based double-authentication-preventing ring signature for security and privacy in vehicular Ad-Hoc networks

Contact Info

Product

Resources

About