A Scalable Robust Authentication Protocol for Secure Vehicular Communications

Zhang, Lei; Wu, Qianhong; Solanas, Agustí; Domingo‐Ferrer, Josep

doi:10.1109/tvt.2009.2038222

Cited by 278 publications

(166 citation statements)

References 25 publications

Supporting

Mentioning

166

Contrasting

Order By: Relevance

“…Recent research in vehicular networks has included topics such as routing algorithms (Li and Wang, 2007), applications (Khaled et al, 2009), security (Zhang et al, 2009), and medium access control performance (Mittag et al, 2008). For example, studies have illustrated the suitability of IEEE 802.11p for highway applications (Bychkovsky et al, 2006;Ott and Kutscher, 2004).…”

Section: Related Workmentioning

confidence: 99%

Scheduling in green vehicular infrastructure with multiple roadside units

Khezrian

Hammad

Todd

et al. 2013

2013 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

In this thesis we consider low complexity downlink traffic scheduling for green vehicular roadside infrastructure. In multiple roadside unit (RSU) deployments, the energy provisioning of the RSUs may differ, and it is therefore desirable to balance RSU usage from a normalized energy viewpoint. We consider both splittable and unsplittable RSU assignment scheduling (SRA and URA). We first derive an offline integer linear programming bound for the normalized min-max RSU energy usage, which can be solved for a given input sample function. We then show that in the SRA case there is a polynomial complexity 2-approximation bound for the normalized min-max energy schedule. These bounds are used for comparisons with several proposed online scheduling algorithms. The first scheduler is a low complexity Greedy Online Algorithm (GOA) that makes greedy RSU selections followed by minimum energy time slot assignments. A normalized min-max online algorithm is then proposed (TOAA) which is an online version of the 2-approximation bound for SRA scheduling.Then, the Greedy Flow Graph Algorithm (GFGA), which makes greedy RSU selections followed by time slots reassignment whenever a new vehicle is assigned to the same RSU. This is done using a locally optimum integer linear program that can be efficiently solved using a minimum cost flow graph. Two low complexity algorithms iv are then introduced based on a potential function scheduling approach. The OneObjective algorithm, uses a primary objective based on normalized min-max energy.The second, the Bi-Objective algorithm, uses the same primary objective combined with a total energy secondary objective. These algorithms have provable performance guarantees, in that their worse-case competitive ratio performance is upper bounded.Results from a variety of experiments show that the proposed scheduling algorithms perform well. In particular, we find that in the SRA case, the TOAA and GFGA algorithms perform very close to the lower bound, but at the expense of having to reassign time slots whenever a new vehicle arrives. In the URA case, our low complexity One-Objective algorithm performs better than the others over a wide range of traffic conditions.

show abstract

Section: Related Workmentioning

confidence: 99%

Scheduling in green vehicular infrastructure with multiple roadside units

Khezrian

Hammad

Todd

et al. 2013

2013 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

show abstract

“…Fortunately, many message authentication schemes have been proposed to address security, efficiency, and conditional privacypreserving for VANETs during the recent 10 years. [8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23] Related work…”

Section: Introductionmentioning

confidence: 99%

Efficient location-based conditional privacy-preserving authentication scheme for vehicle ad hoc networks

Fan

Xie

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Due to the real-time requirement of message in vehicle ad hoc networks, it is a challenge to design an authentication for vehicle ad hoc networks to achieve security, efficiency, and conditional privacy-preserving. To address the challenge, many conditional privacy-preserving authentication schemes using bilinear pairing or ideal tamper-proof device have been proposed for vehicle ad hoc networks in recent years. However, the bilinear pairing operation is one of the most complex cryptographic operations and the assumption of tamper-proof device is very strong. In this article, an efficient location-based conditional privacy-preserving authentication scheme without the bilinear pairing and tamper-proof device is proposed. Compared with the most recently proposed authentication schemes, the proposed scheme markedly decreases the computation costs of message signing and message verification phase, while satisfies all security requirements of vehicle ad hoc networks and provides conditional privacy-preserving.

show abstract

“…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%

Efficient Multilevel Privacy Preserving Authentication Scheme for Emergency Message Communication in VANE

Devi¹,

Alex²

2018

IJET

View full text Add to dashboard Cite

Vehicular ad hoc networks (VANETs) provide spontaneous traffic related and emergency rescue messages to its users of the route thereby enable them with the trouble-free driving. VANETs send emergency messages in times of exigencies that save people"s lives from disasters. Doing such times it has been a great challenge to ascertain the authentication and privacy of the messages that are broadcasted. Generally when the messages are broadcasted without accommodating privacy the confidential information"s like the vehicle"s id and location are exposed which adversely affect the users. In this paper to ensure privacy to the users we have recommended TA to provide a verification signature to all the vehicles which is mandatory for a vehicle for all its communication purpose. Normally in the existing schemes, the messages are provided with single level or bi level privacy features but, in the proposed scheme the emergency messages are provided with the multilevel privacy features. In the proposed scheme the TA provides a long term Verification signature which is mandatory to all the vehicles that are registered under VANET and this signature is also necessary in receiving the secondary token and common token from RSU at each interval of time. The authentication of the message is verified with the help of common token and encrypted common token as a RSU Verification signature. Since the emergency messages require secure, timely and factual communication our proposed protocol EMPPA scheme recommend the distribution of multiple verification signatures and tokens at various interval of time, so that the privacy, security and the authentication of messages are ensured to the VANET users.

show abstract

A Scalable Robust Authentication Protocol for Secure Vehicular Communications

Cited by 278 publications

References 25 publications

Scheduling in green vehicular infrastructure with multiple roadside units

Scheduling in green vehicular infrastructure with multiple roadside units

Efficient location-based conditional privacy-preserving authentication scheme for vehicle ad hoc networks

Efficient Multilevel Privacy Preserving Authentication Scheme for Emergency Message Communication in VANE

Contact Info

Product

Resources

About