Group‐based hybrid authentication scheme for cooperative collision warnings in VANETs

Abstract

Cooperative collision warnings (CCWs) is one of the important applications of Vehicular Ad-Hoc Networks (VANETs) where secure and timely delivery of messages to the neighboring vehicles are needed. Secure communication is as important as timely communication to take proper actions in order to avoid collisions and thus prevent fatal accidents. However, security and delay are two competing metrics since security brings additional processing overhead, increasing the packet delays. While symmetric-key-based security techniques can be more efficient as opposed to public-key cryptography (PKC) in terms of delay, they introduce significant key maintenance overheads with the increased number of vehicles in VANETs. To alleviate this overhead and take the advantage of faster processing, we exploit the natural group behavior in CCW applications. We propose a delay efficient authentication scheme for VANETs which is based on group communication. Groups are created and maintained dynamically led by leader vehicles. Since the data communication within the groups will be dominating the overall packet traffic, we utilize symmetric-key techniques within each group which is handled by the group leader. Group creations on the other hand are less frequent events and thus are done by PKC. We analyzed the security properties of our proposed scheme and tested it with real-world vehicle data. Simulations results confirmed the efficiency in terms of delay with respect to other existing techniques.

SCOOL: A secure traffic congestion control protocol for VANETs

“…Symmetric, asymmetric and groupbased cryptography protocols have been proposed to guarantee the authenticity, confidentiality, integrity, and the privacy features [10], [11], [12]. However, some secure protocols have been proposed to provide a certain service and specifically considering the requirements of these services, such as: secure cooperative collision warnings [13], secure position information [14], secure information dissemination [15], and secure service discovery protocols [16].…”

Secure service discovery protocol for intelligent transport systems

“…The TSVC minimizes the packet overhead due to signature overhead and reduces the latency incurred from the verification of a signature. Riley et al proposed in [11] a secure scheme for cooperative collision warning applications in VANets. They proposed a delay efficient authentication protocol, named GHAP, relaying on a group based behavior.…”

“…Assuming AvgSP the average number of service providers that can satisfy one service request, and that N is the total number of service requests, the total number NbT otalSSRep of service reply messages exchanged during the simulation period T is: Proof: The message complexity MCompSecLocV SDP of our proposed SecLocVSDP for N requests is the summation of the neighbor discovery messages, the group key exchange messages, the update messages, the service providers registration messages, the hash request messages, the hash reply messages, the secure location based request messages, and the secure location based reply messages. The theorem is derived from Lemmas [4][5][6][7][8][9][10][11][12].…”

“…The authentication of infrastructure-less secure service discovery can rely on public key [6][7][8], or symmetric key [9][10][11] as described below. Studer et al presented in [6] TESLA++, which is a modified version of TESLA [9].…”

Towards a secure hybrid adaptive gateway discovery mechanism for intelligent transportation systems

“…The authentication of infrastructure‐less secure service discovery can rely on public key , or symmetric key as described below. Studer et al presented in TESLA++, which is a modified version of TESLA .…”