Authentication and consensus overhead in vehicular ad hoc networks

Vehicular ad hoc networks aim at increasing passenger safety by exchanging warning messages between vehicles wirelessly. A main challenge is to resist to various malicious abuses and security attacks. However, any security mechanism comes with overhead. We analyze how the authentication algorithm ECDSA and the consensus mechanism impact the vehicular network performance and the braking distance. Processing and communication overheads, decision methods for consensus, are analyzed by analytical models and intensive simulations. We propose a formula to assess the total time overhead of the authentication. Results conclude that the authentication key size should be chosen carefully, and the decision method should be adapted to the context.

[1]  Yih-Chun Hu,et al.  Real-World VANET Security Protocol Performance , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[2]  Raja Sengupta,et al.  Empirical determination of channel characteristics for DSRC vehicle-to-vehicle communication , 2004, VANET '04.

[3]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[4]  Kimmo Järvinen,et al.  Final Project Report : Cryptoprocessor for Elliptic Curve Digital Signature Algorithm ( ECDSA ) , 2007 .

[5]  Tamer A. ElBatt,et al.  Cooperative collision warning using dedicated short range wireless communications , 2006, VANET '06.

[6]  Florian Dotzer,et al.  Enhancing the Security of Local DangerWarnings in VANETs - A Simulative Analysis of Voting Schemes , 2007, The Second International Conference on Availability, Reliability and Security (ARES'07).

[7]  Peter Kornerup.  High-radix modular multiplication for cryptosystems , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[8]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[9]  Maxim Raya,et al.  The security of vehicular ad hoc networks , 2005, SASN '05.

[10]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[11]  Hui Chen,et al.  Fast Implementation for Modular Inversion and Scalar Multiplication in the Elliptic Curve Cryptography , 2008, 2008 Second International Symposium on Intelligent Information Technology Application.

[12]  Ricardo Dahab,et al.  Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation , 1999, CHES.

[13]  Elmar Schoch,et al.  Security Engineering for VANETs , 2006 .

[14]  Kris Gaj,et al.  Comparative Analysis of Software Libraries for Public Key Cryptography , 2007 .

[15]  Justin Paul McNew,et al.  5.9 GHz Dedicated Short Range Communications (DSRC) Standards Overview and Status , 2010 .

[16]  Naofumi Takagi,et al.  A Hardware Algorithm for Modular Multiplication/Division Based on the Extended Euclidean Algorithm , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[17]  Robert E. Fenton,et al.  IEEE Vehicular Technology Society , 2018, IEEE Transactions on Vehicular Technology.

[18]  A. Iyer,et al.  Secure V2V communications: Performance impact of computational overheads , 2008, IEEE INFOCOM Workshops 2008.

[19]  Kouichi Sakurai,et al.  Efficient Elliptic Curve Cryptosystems from a Scalar Multiplication Algorithm with Recovery of the y-Coordinate on a Montgomery-Form Elliptic Curve , 2001, CHES.

[20]  Panagiotis Papadimitratos,et al.  Efficient and robust pseudonymous authentication in VANET , 2007, VANET '07.

[21]  M. Torrent-Moreno,et al.  Simulation platform for inter-vehicle communications and analysis of periodic information exchange , 2007, 2007 Fourth Annual Conference on Wireless on Demand Network Systems and Services.

[22]  Zhong Chen,et al.  Proof-of-relevance: Filtering false data via authentic consensus in Vehicle Ad-hoc Networks , 2008, IEEE INFOCOM Workshops 2008.

[23]  Christophe Nègre,et al.  Scalar Multiplication on Elliptic Curves Defined over Fields of Small Odd Characteristic , 2005, INDOCRYPT.

[24]  Lars Wischhof,et al.  Self-organizing Communication in Vehicular Ad Hoc Networks , 2007 .

[25]  Alfred Menezes,et al.  The Elliptic Curve Digital Signature Algorithm (ECDSA) , 2001, International Journal of Information Security.

[26]  Sergey D. Andreev,et al.  Estimation of a successful beacon reception probability in vehicular ad-hoc networks , 2009, IWCMC.

[27]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

[28]  Qi Chen,et al.  Overhaul of ieee 802.11 modeling and simulation in ns-2 , 2007, MSWiM '07.

[29]  Amar Nath,et al.  PERFORMANCE EVALUATION OF SECURE COMMUNICATION IN VEHICULAR NETWORKS , 2009 .