Use of Elliptic Curves in Cryptography
CRYPTO '85 Advances in Cryptology
Smart Cars on Smart Roads: An IEEE Intelligent Transportation Systems Society Update
IEEE Pervasive Computing
Securing vehicular ad hoc networks
Journal of Computer Security - Special Issue on Security of Ad-hoc and Sensor Networks
TACKing together efficient authentication, revocation, and privacy in VANETs
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
SeGCom: secure group communication in VANETs
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
A novel framework for message authentication in vehicular communication networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
MAAC: message authentication acceleration protocol for vehicular ad hoc networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
VPriv: protecting privacy in location-based vehicular services
SSYM'09 Proceedings of the 18th conference on USENIX security symposium
Hi-index | 0.00 |
Vehicular Ad Hoc Network (VANET) is an emerging type of network which facilitates vehicles on roads to communicate for driving safety. It requires a mechanism to help authenticate messages, identify valid vehicles, and remove malevolent vehicles which do not obey the rules. Most existing solutions either do not have an effective message verification scheme, or use the public key infrastructure (PKI). In this network, vehicles are able to broadcast messages to other vehicles and a group of known vehicles can also communicate securely among themselves. So group communication is necessary for the network. However, most existing solutions either do not consider this or use pairing operation to realize this. They are either not secure or not effective. In this paper, we provide a more comprehensive set of secure schemes with Hash-based Message Authentication Code (HMAC) in VANETs to overcome their shortcomings. Of course, we still need to use Pairing operation in some place. Our scheme is composed of three schemes: (1) Communications between Vehicles and Road-Side Units (RSUs), (2) One to One Communications within a Group, (3) One to One Communications without a Group. Based on our simulation study, we show that our schemes are effective and the delay caused is much lower. The average delay caused by our first scheme is nearly thousands of times lower than prior schemes. The average delay caused by our second scheme is 0.312ms, while the delay caused by prior scheme is 12.3ms. Meanwhile the average delay caused by our third scheme is 0.312ms, and the delay caused by prior scheme is about 9s.