EFFICIENT SECRECY MAINTAINING CERTIFICATION SCHEME FOR VANET

Abstract VANET are one of the new promising techniques used to enable communication on roads. Here for VANETs an efficient secrecy maintaining authentication scheme is done .To detect anonymous authentication group signature is used widely used but in previous scheme it suffers from long computation delay in CRL (certificate revocation list) checking. It leads to a high message loss.so they cannot achieve the target of receiving 100 of messages per second.so HMAC is used here to avoid time consuming CRL checking and to ensure the integrity of messages before batch group authentication. To reduce authentication burden each vehicle needs to verify a small number of messages using cooperative message authentication among entities. Hence security and performance analysis shows that our scheme is more efficient in terms of authentication speed by keeping conditional privacy in VANETs. Thus the proposed scheme is analyzed through simulations in NS2 and proved to out performs the existing available techniques. Keywords-Vehicular Ad Hoc Network (VANET), CRL(Certificate Revocation List)HMAC(Hash Message Authentication Code),Cooperative Message Authentication. 1. Introduction In the advanced development of wireless communication technologies, car manufactures and telecom industries help to equip each vehicle with wireless devices. It allows vehicles to communicate with each other as well as with other vehicles network communication devices like road side units (RSU) and Trustedauthority (TA)etc. Generally a VANET consists of three components they are onboard units, Road side units and a central trusted authority. In VANET when vehicles communicate with each other and also with RSU and TA in which the attackers can easily get users private information such as identity, tracing etc. The reason is that they are not properly protected so we should design an efficiency secrecy maintaining authentication scheme for VANET. In previous scheme group signature is used for detecting unknown authentication so for which any group member allows to sign behalf of the group without reveling its real identity. So when a vehicle receives a message from unknown entity, a vehicle has to check the (certificate revocation list) CRL to avoid communicate with revoked vehicles. Also To verify the sender's group signature to check the validity of the received message. The problem here occurs is the time consuming for CRL checking because it takes 11ms to verify a message with a group signature and 9ms to check one identity in CRL. If n revoked number in CRL th number of messages verified in one second is 1000/9n+1 it is very smaller than the target of verifying 600.so we should try to overcome the delay caused by CRL checking and group signature verification to achieve rapid authentication. Thus an efficient privacy authentication scheme for VANET has been done through RSU by jointly using the techniques of distributed management, HMAC, group signature verification and cooperative authentication. First dividing the precinct into several domains so the system can run in a localized manner. Then HMAC is calculated with group key generated by the self-healing group-key generation algorithm which reduces time consuming CRL checking and ensure the integrity of messages before batch verification. Then cooperative message authentication is used to improve the message authentication scheme .By using these P.Anand Sateesh Kumar et al

Infocast: A New Paradigm for Collaborative Content Distribution from Roadside Units to Vehicular Networks Using Rateless Codes

In this paper, we address the problem of distributing a large amount of bulk data to a sparse vehicular network from roadside infostations, using efficient vehicle-to-vehicle collaboration. Due to the highly dynamic nature of the underlying vehicular network topology, we depart from architectures requiring centralized coordination, reliable MAC scheduling, or global network state knowledge, and instead adopt a distributed paradigm with simple protocols. In other words, we investigate the problem of reliable dissemination from multiple sources when each node in the network shares a limited amount of its resources for cooperating with others. By using \emph{rateless} coding at the Road Side Unit (RSU) and using vehicles as data carriers, we describe an efficient way to achieve reliable dissemination to all nodes (even disconnected clusters in the network). In the nutshell, we explore vehicles as mobile storage devices. We then develop a method to keep the density of the rateless codes packets as a function of distance from the RSU at the desired level set for the target decoding distance. We investigate various tradeoffs involving buffer size, maximum capacity, and the mobility parameter of the vehicles

Impact of malicious node on secure incentive based advertisement distribution (SIBAD) in VANET

Last decade has seen an increasing demand for vehicle aided data delivery. This data delivery has proven to be beneficial for vehicular communication. The vehicular network provisions safety, warning and infotainment applications. Infotainment applications have attracted drivers and passengers as it provides location based entertainment services, a value add to the traveling experience. These infotainment messages are delivered to the nearby vehicles in the form of advertisements. For every advertisement disseminated to its neighboring vehicle, an incentive is awarded to the forwarder. The incentive based earning foresee a security threat in the form of a malicious node as it hoards the incentives, thus are greedy for earning incentives. The malicious behavior of the insider has an adverse effect on the incentive based advertisement distribution approach. In this paper, we have identified the malicious nodes and analyzed its effect on incentive based earning for drivers in vehicular networks. © 2017 IEEE

Secure Authentication and Privacy-Preserving Techniques in Vehicular Ad-hoc NETworks (VANETs)

In the last decade, there has been growing interest in Vehicular Ad Hoc NETworks (VANETs). Today car manufacturers have already started to equip vehicles with sophisticated sensors that can provide many assistive features such as front collision avoidance, automatic lane tracking, partial autonomous driving, suggestive lane changing, and so on. Such technological advancements are enabling the adoption of VANETs not only to provide safer and more comfortable driving experience but also provide many other useful services to the driver as well as passengers of a vehicle. However, privacy, authentication and secure message dissemination are some of the main issues that need to be thoroughly addressed and solved for the widespread adoption/deployment of VANETs. Given the importance of these issues, researchers have spent a lot of effort in these areas over the last decade. We present an overview of the following issues that arise in VANETs: privacy, authentication, and secure message dissemination. Then we present a comprehensive review of various solutions proposed in the last 10 years which address these issues. Our survey sheds light on some open issues that need to be addressed in the future

Cooperation as a Service in VANET: Implementation and Simulation Results

The past decade has witnessed the emergence of Vehicular Ad-hoc Networks (VANET), specializing from the well-known Mobile Ad Hoc Networks (MANET) to Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) wireless communications. While the original motivation for Vehicular Networks was to promote traffic safety, recently it has become increasingly obvious that Vehicular Networks open new vistas for Internet access, providing weather or road condition, parking availability, distributed gaming, and advertisement. In previous papers [27,28], we introduced Cooperation as a Service (CaaS); a new service-oriented solution which enables improved and new services for the road users and an optimized use of the road network through vehicle\u27s cooperation and vehicle-to-vehicle communications. The current paper is an extension of the first ones; it describes an improved version of CaaS and provides its full implementation details and simulation results. CaaS structures the network into clusters, and uses Content Based Routing (CBR) for intra-cluster communications and DTN (Delay and disruption-Tolerant Network) routing for inter-cluster communications. To show the feasibility of our approach, we implemented and tested CaaS using Opnet modeler software package. Simulation results prove the correctness of our protocol and indicate that CaaS achieves higher performance as compared to an Epidemic approach