AMOEBA: Robust Location Privacy Scheme for VANET

As a prime target of the quality of privacy in vehicular ad hoc networks (VANETs), location privacy is imperative for VANETs to fully flourish. Although frequent pseudonym changing provides a promising solution for location privacy in VANETs, if the pseudonyms are changed in an improper time or location, such a solution may become invalid. To cope with the issue, in this paper, we present an effective pseudonym changing at social spots (PCS) strategy to achieve the provable location privacy. In particular, we first introduce the social spots where several vehicles may gather, e.g., a road intersection when the traffic light turns red or a free parking lot near a shopping mall. By taking the anonymity set size as the location privacy metric, we then develop two anonymity set analytic models to quantitatively investigate the location privacy that is achieved by the PCS strategy. In addition, we use game-theoretic techniques to prove the feasibility of the PCS strategy in practice. Extensive performance evaluations are conducted to demonstrate that better location privacy can be achieved when a vehicle changes its pseudonyms at some highly social spots and that the proposed PCS strategy can assist vehicles to intelligently change their pseudonyms at the right moment and place.

In Vehicular Ad Hoc Networks (VANETs), a vehicle could be identified and tracked by eavesdropping its messages (e.g., beacons) by an adversary, since these messages contain personal information such as the location of the vehicle. This attack leads to threats on the user's location privacy. Frequent changing pseudonyms are accepted as a solution to protect the location privacy of users in VANETs. In this paper, we propose an efficient pseudonym changing strategy to provide location privacy in VANETs. In addition, we describe a novel tracking attack, that is, the cheating attack. To confront this attack, we develop a cheating detection mechanism. Finally, we show by simulations that the proposed scheme is effective.

Although Vehicular Ad hoc NETworks (VANETs) can improve safety, efficiency and convenience in transportation, VANETs also introduce some location privacy risk by periodically broadcasting beacon message. Frequently changing pseudonyms is commonly accepted as one approach to protect location privacy in VANETs, but most changing pseudonyms schemes have disadvantages of lacking flexibility, facing with the risk of safety and inefficient, and neglect the practical implications. In this paper, we propose a novel and practical pseudonym change scheme, called CPSN. In the CPSN scheme, the minimum use time of pseudonym is introduced to guarantee routing functionality. Moreover, considering user vehicle in a real VANET being rational and selfish, we use Game theory to prove the feasibility of the CPSN scheme in reality. Finally, we investigate the performance of CPSN by simulation. The results indicate that the CPSN scheme not only provides enough location privacy protection but also satisfies the requirements of routing.

In the Vehicular Ad-hoc Networks (VANETs), a vehicle or the vehicle driver could be recognized and tracked by eavesdropping its queries (e.g., beacons) by an adversary, since these quires contain personal information and data such as the queries and location of the vehicle. This attack leads to threats on the vehicles location privacy. The current solutions, exercises Anonymizer, a third trusted party (TTP) in between the LBS and the vehicles. The insertion of the TTP shifts the endangered entity from the LBS to the Anonymizer, regarding security risk, and with the jeopardized anonymizer, the vehicles or vehicles drivers related data will also be at risk. In this paper, we come up with efficient query based dual location privacy in VANETs for V2V and V2I communication. In which we use the circle based dummy generation (CBDG) algorithm along with TTP. Before sending the query to the TTP first we create some dummy location by using CBDG, because we cannot trust completely on TTP architecture. And then we use CASPER as TTP to process the desired query from vehicles to LBS. after receiving the processed query from the LBS, the TTP sends the results back to the drives, where the vehicle drivers finds their desired results. Our results shows that the proposed scheme preserve the location privacy based on the queries at low communication and computational cost.

Ensuring safety in vehicular ad hoc networks (VANETs) requires the connected vehicles to exchange real time accurate road information. However, this necessity risks the privacy and may violate the user's confidentiality. The periodically broadcasted beacon messages containing the vehicle's spatiotemporal road information, and signed using the vehicle's temporal public key are the main factors leading to that risk. Since these factors are fundamental for the correct functioning of a vehicular network and, hence, cant’ be ignored, a solution that preserves the location privacy is needed. In this paper, we aim to preserve the location privacy through a robust pseudonym change strategy that ensures the unlinkability. The proposed method confuses the attacker at the pseudonym update phase to thwart the linkability. It combines the “hiding within the crowd” and the “location obfuscation” techniques. The simulation results of the proposed scheme illustrate a high protection level against a global passive attacker executing semantic and syntactic linking attacks. This is further emphasized through the established comparative study.

A survey on Intrusion Detection Systems and Honeypot based proactive security mechanisms in VANETs and VANET Cloud

Objectives: To explored the highlighted obliged QoS routing issue in Vehicular Ad hoc Networks (VANETs). Methods/ Statistical Analysis: The issues are tended to firstly by working up an association faithful quality model considering the topological and numerical properties of vehicular advancements and speeds. The VANET correspondence diagram in advancing chart hypothesis is used to model and organize the formed association trustworthiness shown into it. In light of the consequent intensified chart diagram illustrate, the most tried and true course in the framework is picked. However course assurance does not ensure awesome transmission as well. Findings: Vehicular extraordinarily designated Systems (VANETs) are a particular sort of remote framework made by vehicles giving among themselves and with roadside base stations. A broad assortment of organizations has been made for VANETs going from security to infotainment applications. A key need for such organizations is that they are offered with Nature of Administration Quality of Service (QoS) guarantees similar to organization unfaltering quality and availability. QoS routing expect an essential part in recognizing courses that meet the QoS necessities of the offered organization over VANETs. For filtering the achievable courses it subject to various QoS goals is with everything taken into account a NP-difficult issue. Furthermore, the reliability of the routing ought to be given unprecedented thought as correspondence associations, as frequently as conceivable in VANETs. In present situation, the most existing QoS routing calculations are been PSO algorithm for stable VANET system without considering the security and wellbeing of the routing procedure. Along these lines, they are not appropriate for applications in VANETs. Application/Improvements: Low complexity nature advanced administration dependable routing calculation is made to ensure to lessen transmission redundancy with use of Subterranean insect State estimation with better eventual outcomes of course decision and transmission considering better request and sorting calculations in the Particle Swam Optimization (PSO) algorithm work calculation for extremely powerful VANET system with less preferred quality in evaluation with favoured data transmission over interchange QoS counts as shown by the results and satisfy QoS requirements of specific traffic using PSO in the VANET routing protocol environments. Meanwhile, an optimized function with PSO is also proposed to make scheduling decisions so that the dropped packet rates are reduced. The results of PSO algorithm simulations are better and feasible as compared to the previous techniques. Keywords: Graph Theory, Optimised Service Reliable Routing Algorithm, Particle Swam Optimization, Quality of Service, Roadside Base Stations, VANET

In vehicular ad hoc networks (VANETs), vehicles communicate with each other and with roadside units (RSUs) in order to enhance road safety, improve traffic management and provide infotainment services. Along with the growth of VANETs, some challenges are emerging. Although there are many research work on VANETs, cheating attacks are still not well resolved such as selective message relaying attack, faked information reporting attack and resource-consuming attack launched by selfish or malicious participants. To deal with this kind of attacks, we present two novel lightweight security mechanisms by equipped each vehicle's On-Board Unit (OBU) with a small elegant module called TrInc, which is a trusted hardware and composed of only a non-decreasing counter and a key. We observe that TrInc-based method not only can effectively resist against cheating attacks in safety- oriented, convenience-oriented, and commercial-oriented VANET applications, but also significantly defend various aspects of security and privacy in VANETs. Compared with previous works, our proposal features low communication and computation overhead, less memory requirements, and good network scalability.

Vehicular Ad hoc Networks (VANETs) have become a cornerstone component of Intelligent Transportation Systems (ITS). VANET applications present a huge potential for improving road safety and travel comfort, hence the growing interest of both academia and industry. The main advantage of VANETs is its ad hoc nature which does not require fixed infrastructure or centralized administration. However, designing scalable information dissemination techniques for VANET applications remains a challenging task due to the inherent nature of such highly dynamic environments. Existing dissemination techniques often resort to simulation for performance evaluation and there are only few studies that offer mathematical modeling. In this paper we provide a comparative study of existing performance modeling approaches for data dissemination techniques designed for different VANET applications.

Providing an efficient anonymous authentication scheme in vehicular ad hoc networks (VANETs) with low computational cost is a challenging issue. Even though, there are some existing schemes to provide anonymous authentication, the existing schemes suffer from high computational cost in the certificate and the signature verification process, which leads to high message loss. Therefore, they fail to meet the necessity of verifying hundreds of messages per second in VANETs. In our scheme, we propose an efficient anonymous authentication scheme to avoid malicious vehicles entering into the VANET. In addition, the proposed scheme offers a conditional tracking mechanism to trace the vehicles or roadside units that abuse the VANET. As a result, our scheme revokes the privacy of misbehaving vehicles to provide conditional privacy in a computationally efficient way through which the VANET entities will be anonymous to each other until they are revoked from the VANET system. Moreover, the proposed scheme is implemented and the performance analysis shows that our scheme is computationally efficient with respect to the certificate and the signature verification process by keeping conditional privacy in VANETs.

Securing the Vehicular Adhoc Networks (VANETs) along with appropriate protection of the privacy of drivers or vehicle owners is a very challenging task. Drivers' behavioral tendencies can be reflected in the mobility patterns of the vehicles (rational behavior). Misbehaving vehicles are always threat to safety, VANETs security and privacy. Detection of misbehavior can enhance security and privacy in VANETs. This paper is presenting a mobility pattern based misbehavior detection approach in VANETs. Simulation results show that the Location Anonymous Message based proposed approach has the potential to improve security and maintain privacy in VANETs.

Vehicular Ad Hoc Network (VANET) is a promising area of research and development as it has remarkable role in improving safety of vehicles on road, efficient traffic management, and providing comfort to commuters. The typical characteristics of VANET environment pose several challenges for VANET application developers. There is always a demand for scalable communication mechanisms suitable for low- and high-speed vehicles, information dissemination techniques that suit sparse and dense traffic conditions. Thus, the reliability of any VANET application strongly depends upon the robustness of the underlying communication architecture. Any VANET communication model shall strictly adhere to the wireless access standards and specifications laid down for vehicular communications. In this work, we have designed and implemented a basic VANET communication model that facilitates both Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communication adhering to IEEE 802.11p standards. The Physical and Link Layer extensions of WAVE standard have been integrated to EXata5.1 (network emulator) to support IEEE 802.11p communication. Necessary Graphical User Interface and library level extensions were made to create VANET scenarios. To demonstrate and evaluate our communication model, urban scenarios with different node densities were created in EXata. The communication scenarios were emulated with predefined mobility of nodes, CBR as the traffic application and Bellman Ford as the default routing protocol. Using EXata analyzer, the performance metrics were analyzed and found that our basic VANET communication model offers good throughput at high vehicle densities with a soft delay constraint.

Vehicular Ad Hoc networks (VANETs) have been employed in supporting several applications related to safety and comfort. VANET applications have strict security requirements, as they have direct impact on people comfort and safety. Although many ordinary networks security systems can be applied to provide security services in VANET, the key establishment between legitimate vehicles is the common challenge among all of these systems. This paper proposes a secret key establishment technique for vehicular communications exploiting the special properties and randomness inherent of the wireless channel. Our comprehensive simulations show that the proposed key extraction technique suits VANETs rather than other communication systems, owing to the multi environments operation of VANET which causes more randomness due to fading, noise multipath and velocity variation. The proposed approach can be tuned to extract low or high rate secret key with high entropy rate and less information exchange between legitimate vehicles. The extracted secret key can be employed to support providing security services in VANET.

Communication messages in vehicular ad hoc networks (VANETs) can be used to locate and track vehicles, and this can lead to threats on location privacy of vehicle users. In this paper, we address the problem of privacy and liability in VANETs. We propose a scheme that provides location privacy by utilizing a variant of ring signature. It allows a vehicle to form a ring arbitrarily with nearby vehicles and sign its messages anonymously, so that it can hide itself in the surrounding vehicles. When solving a dispute, the real signer will be responsible for what it has signed as the anonymity is revocable by the authority.

Vehicular ad hoc networks (VANETs) have the potential to change the way of people drive, travel and so on, in which vehicle can broadcast and forward the message of road condition or emergency. When the received messages are unreliable, they may lead the vehicles to make wrong decisions. To assess how trustworthy the messages are, every vehicle holds the reputation value in the trust-based schemes. In pseudonym-based schemes, vehicles change their pseudonyms by some kind of manner to confuse the trackers. However, the reputation value provides an additional clue to track vehicle when it and the pseudonym change asynchronously. To reconcile the conflict of privacy preservation and reputation evaluation, we propose a distributed trust framework for pseudonym-enabled privacy preservation in VANETs. In this framework, the road side unit assigns the reputation label certificate (RLC) to evaluate the reliability of message for every vehicle in its communication range. To preserve the privacy, the RLC manifests two trust statuses to replace the specific reputation value. All the reputation values of vehicles are stored in the centrical database. To encourage vehicle to follow the rules, the reputation update algorithm is designed with different weights, which achieve the reputation value increasing slowly and decreasing quickly. When RLC of vehicle is revoked, its security and privacy will not be protected. Finally, theoretical analysis and simulations show that our scheme can efficiently meet the requirements of security and privacy in VANETs.