RETRACTED ARTICLE: Location Privacy with Dynamic Pseudonym-Based Multiple Mix-Zones Generation over Road Networks

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.

“…T rep can be calculated by event reputation as follows:

T_{rep ((), t)} = ({, \begin{array}{l} normalℂ T_{rep ((), t)} ((), normalt - 1), if ((), T_{evt true)} ((), t) =) 0 true) \\ normalℚ true(T_{evt true)} ((), t) + ((), 1 - normalℚ) T_{rep ((), t)} ((), normalt - 1), else \end{array}) .

…”

Section: Proposed Methodsmentioning

confidence: 99%

Section: Proposed Methodsmentioning

confidence: 99%

Section: Proposed Methodsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

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

Memon

Mirza

2018

Self Cite

“…Many protocols take advantage of routing and time stamp . Routing and time stamps are used to make real‐time decisions about the environment.…”

Section: Introductionmentioning

confidence: 99%

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

Memon

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.

Non‐dominated sorting particle swarm optimization (NSPSO) and network security policy enforcement for Policy Space Analysis

Sureshkumar

Lingaraj²,

Anand³

et al. 2018

Summary Network operators depend on security services with the aim of safeguarding their IT infrastructure. Various types of network security policies are employed on a global scale and are disseminated among several security middleboxes implemented in networks. But, owing to the complications in security policies, it is not quite efficient to directly use the path‐wise enforcement schemes that are prevalent. The major motivation of this work is to improve security levels and solve the policy enforcement problem. For the first time, this work reports the issue of policy enforcement on middleboxes. The major contribution of this work is to design security policy enforcement as a Weighted K Set Covering Problem, and we designed a Policy Space Analysis (PSA) tool intended for a group of operations in the security policy. This PSA tool was developed based on range‐signified hyper‐rectangles, which are indexed by the Hilbert R‐tree. Leveraging the PSA, we first investigated the topological features of various kinds of policies. Balancing the PSA tool in a non‐dominated sorting particle swarm optimization technique exposes the intrinsic difficulties of this security strategy and provides guidance for designing the enforcement approach. In addition, in this research, a new fuzzy rule‐based classification system is introduced for packet classification. A scope‐wise policy enforcement algorithm was proposed, which chooses a moderate number of enforcement network nodes for deploying multiple policy subsets in a greedy manner. This scheme is much quicker compared with the first one and therefore has found its application in real‐time deployments.