Pseudonym changing strategy with multiple mix zones for trajectory privacy protection in road networks

Mirza

2018

Self Cite

Summary In intelligent transportation systems, the messages transmitted and received from one vehicle to another vehicle may enhance location privacy scheme; falsification message forwarding collusion attack, timing, and transition attacks all are serious issues and must be addressed in event trust management. Without which, decision making on event message may endanger the whole transportation system and may even threat the human life. In addition, pseudonym expiry is another critical issue of location privacy. The time interval of decision waiting even has been the critical accident response time. In this paper, we proposed a new novel mix zones and dynamic pseudonym trust management system, called MADPTM, which aims to prevent against attackers under privacy‐enhanced road networks. On shortening the pseudonym expiry, we propose dynamic pseudonym trust management system, with the assistance of reported server. We performed a set of simulations under many trust attack models to evaluate the performance and efficiency of the proposed system. Our proposed MADPTM method proved to be highly resilient to various attacks, and simulation results verified that our method outperforms other existing methods.

Section: Discussionmentioning

confidence: 99%

“…Change pseudonym:

\sum_{w = 0}^{x - 1} P ({}, N_{U}^{V} = w) P ({}, N_{V}^{Q} = x - 1 - w) P_{V_{w}} P_{q_{x - 1 - w}} .

Equation denotes probability of all X‐1 neighbors also changing their pseudonyms with the target to target vehicle when V w and Q x − 1 − w satisfy Equation condition:

normalP ({}, (||, At) = normalx) = \sum_{w = 0}^{x - 1} P ({}, N_{U}^{V} = w) P ({}, N_{V}^{Q} = x - 1 w)

{lpg}_{j} = - \frac{d_{i}}{{up}_{m} + 1} - ((), - d_{i}) = \frac{{italicup}_{m}}{{up}_{m} + 1} d_{j}

Finally, PCS strategy is feasible in practice as follows: The distance between two vehicles F i and F i − 1 which have been represented by

Y_{i}^{L}

. Variables such as

Y_{1}^{L}, Y_{2}^{L}, Y_{3}^{L} \dots \dots . Y_{i}^{L}

are identically distributed and independent; also probability density function is f ( x ) = λ e − λ x . The Li is left vehicle, and the target T vehicle distance between has been denoted by

S_{i}^{L}

.…”

Section: Proposed Methodsmentioning

confidence: 99%

Section: Vehicle Trust Communication Systemmentioning

confidence: 99%

See 1 more Smart Citation

MADPTM: Mix zones and dynamic pseudonym trust management system for location privacy

Mirza

2018

Self Cite

“…Road network of mobile vehicle composes by an enormous number of vehicles that can be deployed in the designing area over the road network and the nodes self‐organized form a wireless communication network system by the way of a single or multihop . The vehicle system is broadly applied over the road network to design the physical environment vehicle monitoring data that especially work in severe and distinct environment, which people are difficult to get close to gather …”

Section: Introductionmentioning

confidence: 99%

Distance and clustering‐based energy‐efficient pseudonyms changing strategy over road network

2018

Self Cite

Summary To improve the fairness, the energy consumption changing pseudonyms needs to be taken into account. Existing works focus on changing velocity‐based pseudonyms changing strategy and short changes interval with limited coverage, but due to similar velocity and short changes, internal attacker guesses easily known communication and location information due to location information of vehicle on tracking, which may expose adversary private information, and frequently, pseudonyms changing occurs due to movement of vehicles' similar velocity and short coverage, which may cause serious attack of vehicle. To overcome this problem, distance and cluster can be performed. In this work, we proposed distance and cluster‐based energy pseudonyms changing method for road network. We proposed distance and energy‐based clustering routing service over road network, the cluster head elected to depend on random number of distance and energy to change pseudonyms of vehicles. An each interval to be establish cluster head vehicle deployed while selects the operation mode and informs the cluster members of the selected mode through beacon signal. The cluster head vehicle node performs the pseudonyms changing based on the predicted distance and energy of the cluster member to use clustering optimization. The data of whole network send to report server through these nodes while near the RSU, and the vehicles in this area will use less energy to change the pseudonyms. The simulation results show that the proposed method enhances pseudonyms changing strategy less consumption and delays sufficient privacy level each vehicle also our method has outperform compare with existing methods than we use Sumo simulation and Matlab tools to verify our proposed method. Our proposed method outperformed in terms of pseudonym changing energy efficiency to careful attention during the cluster formation process, stable and balanced clusters that prolong the network lifetime, increases distances to more CH vehicles connectivity to makes clustering group and changing their pseudonyms in terms of high level privacy and finally, CH nodes use Dijkstra's algorithm use MST among the vehicles nodes depend on existing road networks to follow shortest path selection roads in terms of high connectivity probability of CH and stable structure of the network decreases the topology changes and thus,the clustering overhead is reduced.

“…In 2017, Memon et al proposed the location privacy protection for mapping services. In the same year, Memon et al also proposed pseudonym changing strategy with multiple mix zones for trajectory privacy protection in road networks. In 2017, Li et al proposed an anonymous mutual authentication and key agreement scheme for wearable sensors in wireless body area networks.…”

Section: Introductionmentioning

confidence: 99%

A secure and enhanced elliptic curve cryptography‐based dynamic authentication scheme using smart card

Madhusudhan

Hegde

2018

Self Cite

Summary In remote system security, 2‐factor authentication is one of the security approaches and provides fundamental protection to the system. Recently, numerous 2‐factor authentication schemes are proposed. In 2014, Troung et al proposed an enhanced dynamic authentication scheme using smart card mainly to provide anonymity, secure mutual authentication, and session key security. By the analysis of Troung et al's scheme, we observed that Troung et al' s scheme does not provide user anonymity, perfect forward secrecy, server's secret key security and does not allow the user to choose his/her password. We also identified that Troung et al's scheme is vulnerable to replay attack. To fix these security weaknesses, a robust authentication scheme is proposed and analyzed using the formal verification tool for measuring the robustness. From the observation of computational efficiency of the proposed scheme, we conclude that the scheme is more secure and easy to implement practically.