Mobile Information Systems

Mobile Information Systems / 2019 / Article

Research Article | Open Access

Volume 2019 |Article ID 3109238 | 9 pages |

Mix-Context-Based Pseudonym Changing Privacy Preserving Authentication in VANETs

Academic Editor: Yuh-Shyan Chen
Received15 Jan 2019
Revised01 Apr 2019
Accepted02 Apr 2019
Published02 Jun 2019


Vehicular ad hoc networks (VANETs) have attracted significant attention in academia insofar as they can provide reliable and secure communication between vehicles. It is thus essential to ensure security and preserve privacy. In this paper, we propose mix-context-based pseudonym changing privacy-preserving authentication (MPCPA). MPCPA introduces privacy protection through a mutual authentication mechanism to prevent attack-vehicles from sneaking into a VANET system. Moreover, it preserves the integrity of transmitted messages with an anonymous authentication mechanism. In addition, MPCPA adopts a mix-context-based pseudonym changing strategy to prevent vehicle tracking. A performance analysis demonstrates that MPCPA incurs low computational costs and offers a privacy-preserving scheme that is more secure than existing authentication schemes.

1. Introduction

Vehicular ad hoc networks (VANETs) have gained momentum recently due to the emergence of intelligent transportation systems (ITSs). 5G is the next-generation mobile communication system, which is being developed for the expected demand of VANETs [1]. Most ITS research is dedicated to VANETs, offering extensive improvements to the safety and efficiency of transportation networks [2]. Wireless communication permits vehicle-to-infrastructure (V2I) and vehicle-to-vehicle (V2V) communication, as shown in Figure 1. As such, VANETs can improve road safety and offer value-added services to drivers on the road. Here, the infrastructure mainly refers to roadside units (RSUs). Furthermore, through V2V and V2I communication, VANETs can deliver safety-related messages (e.g., emergency reporting, collision warnings, and lane-change assistance) as well as traffic management and infotainment messages [3].

Although the feasible benefits for building up traffic safety and efficiency are conceptually attractive, there are some security and privacy challenges that need to be addressed in order to deploy VANETs [4, 5]. For instance, to prove that the sender is a genuine vehicle, messages broadcasted by the sender need to be signed. Neighboring vehicles are then able to verify the integrity of the message and the authenticity of the sender.

However, unlike mobile ad hoc networks, VANETs have distinct characteristics that require specific technology to authenticate messages, identify attackers, and protect the privacy and security of the driver’s information.

Several privacy requirements for VANETs are identified in the literature. Anonymity is essential among these [6]. Messages must be authenticated without revealing the senders’ identifiers. In order to meet this requirement, many pseudonymous authentication schemes have been proposed.

A pseudonym is an anonymous certificate that does not reveal any information about the real identifier of the vehicle. Pseudonyms can be generated or pregenerated on demand [7, 8]. If they are pregenerated, the pseudonyms are stored in the vehicle’s on-board unit [9]. However, research has revealed that the position of a vehicle can be tracked even when pseudonyms are used, as a result of a pseudonym linking attack [10]. An attacker can excavate the relationship between pseudonyms and the real identification of the vehicle. Then, the attacker can steal the vehicles’ real identification.

In order to address the above issues, we propose an efficient privacy preserving authentication scheme that we call mix-context-based pseudonym changing privacy-preserving authentication (MPCPA). Our main contributions are as follows:(1)MPCPA is a privacy protecting mutual authentication mechanism that prevents attack-vehicles from sneaking into the VANET system(2)MPCPA preserves the integrity of transmitted messages with an anonymous authentication mechanism(3)MPCPA offers a mix-context-based pseudonym changing strategy with the capability of preventing vehicles from being tracked(4)Experimental results show that the proposed authentication mechanism is efficient and that the pseudonym changing strategy protects against pseudonym linking attacks.

The remainder of this research is organized as follows. A brief review of related works is presented in Section 2. Our system model and the necessary preliminaries are described in Section 3. In Section 4, the efficient privacy preserving anonymous authentication scheme is discussed, and in Section 5, the pseudonym changing strategy is described in detail. Finally, we conclude the paper with a summary in Section 6.

There is ample research that undertakes privacy and pseudonymity. For instance, Zhang et al. [11] proposed a novel identity-based batch verification (IBBV) algorithm, although the algorithm is vulnerable to nonrepudiation attacks. Shim [12] introduced an efficient identity- (ID-) based signature (IBS) algorithm that is able to protect against impersonation attacks. However, it is vulnerable to modification attacks. Thenmozhi et al. [13] proposed blind signature-based security and privacy. It implements a security mechanism using blind signature, where the roadside units in collaboration with the trusted authority generate the keys to be transmitted to the vehicles.

When providing safety-related messages to vehicles, only authenticated vehicles are allowed to communicate in the network and only authenticated messages can be exchanged among vehicles. Considering the privacy of vehicles, the authentication operation is done anonymously. However, existing algorithms suffer from high computational costs incurred by anonymous authentication. Thus, Vijayakumar et al. [14] proposed an efficient privacy preserving anonymous batch authentication scheme. Their scheme verifies the authenticity of a batch of vehicles when a batch of messages is received.

Islam et al. [15] designed a password-based conditional privacy preserving authentication protocol without bilinear pairing or an elliptic curve. The protocol avoids heavy computational costs and introduces a group-key generation mechanism, where vehicles can only communicate with vehicles that have the same group-key. Azees et al. [16] proposed efficient anonymous authentication in order to avoid malicious vehicles from entering into the VANET. However, their scheme still suffers from high computational costs.

In addition, a pseudonym changing approach is a common anonymous privacy protection mechanism. Freudiger et al. [17] proposed a game-theoretic solution to change pseudonyms (GSCP). Moreover, Ying et al. [18] introduced dynamic mix-zones for location privacy. However, their scheme is susceptible to semantic linking attacks. In order to avoid adversaries from making predictions, Pan et al. [19] proposed a random pseudonym changing algorithm. Moreover, Eckhoff et al. [20] proposed a mix-zone-based pseudonym changing strategy. According to the strategy, most vehicles change their pseudonym at the same time.

3. System Model and Preliminaries

3.1. System Model

VANETs consist of three types of network entities, as shown in Figure 2, viz., trusted authorities (TAs), RSUs, and vehicles.

TAs are in charge of registering vehicles and RSUs. In other words, the TA is responsible for issuing public/private key pairs and certificates [21]. It is worth mentioning that a TA is considered to be fully trusted.

An RSU is infrastructure deployed at the road side, subordinated by the TA. RSUs can connect to the Internet and communicate with vehicles within range. Furthermore, a vehicle communicates with the TA through the adjacent RSU.

Vehicles are motorized vehicles operating on the road. These vehicles mainly communicate with one another to share local traffic information. In addition, each vehicle is equipped with a tamper-proof device. This device stores the private and public keys for the vehicle. It is assumed that TAs, RSUs, and vehicles all have certain computing power. Moreover, all three communication entities adopt a consistent time mechanism.

3.2. Mathematical Model

Bilinear pairing technology was proposed by Boneh et al. in 2004 and forms the basis of our proposed authentication mechanism [22]. The mechanism is based on two additive cyclic groups and a multiplicative group. We denote the additive groups by and and the multiplicative group by . The three groups have the same prime order, . It is worth mentioning that is a large prime. The bilinear map is . The bilinear map satisfies the following properties:(1): , the mapping is considered to be bilinear when it satisfies the following equation:where and are generators of and , respectively, and . Among them, .(2)Nondegeneracy: .(3): there is an efficient algorithm that easily computes the bilinear map .

4. Privacy Preserving Anonymous Authentication Scheme

This section describes the proposed pseudonym authentication framework. The framework consists of three parts: system initialization, registration, and mutual authentication of pseudonyms. The authentication framework is shown in Figure 3.

Pandi et al. [21] proposed an efficient anonymous identity authentication scheme to protect privacy. However, the random numbers in the parameters must be completely random, and it is unclear how collisions are prevented. On the basis of this, temporal parameters are added to avoid collisions when generating random numbers.

4.1. System Initialization

During system initialization, the TA is responsible for generating basic common parameters. First, the TA generates two random numbers, , as private keys, where is the primary key. That is, . Because the values of and are repeatedly used in the following steps, the results are calculated in advance and saved in the form of parameters for subsequent use. Let and . The hash function is then introduced. The common parameters of the system are expressed as .

4.2. Registration Process

During the registration phase, the TA is responsible for generating public keys, private keys, and pseudonyms for the RSUs and vehicles. For a vehicle, for example, the public key, private key, and pseudonym are generated as follows:

Step 1. When a vehicle moves into the TA’s communication range, it transmits its name, address, license plate number, and other basic information to the TA—together with the sending time of this message. Due to the TA’s limited communication range and the high-speed movement of vehicles, few vehicles will be near the TA concurrently. Indeed, because the transmission time of a vehicle is recorded in seconds, is almost certainly unique. Therefore, this data can be used to identify the vehicle.

Step 2. The TA generates a random number by using as the seed for the random number after receiving the basic information sent by vehicle . The random number is used as the system private key for vehicle . That is, . Then, the TA calculates as the system public key for vehicle .

Step 3. In order to avoid transmitting real information about the vehicle during the authentication process, a forged vehicle identification code, i.e., the pseudonym, is used as the identification during vehicle authentication. The pseudonym is used to protect the privacy of vehicle from other vehicles. The initial pseudonym is calculated by the TA.

Step 4. The TA calculates and considers it a fake ID for vehicle .

Step 5. The TA stores the information of vehicle . At the same time, the TA sends the initial pseudonym, public key, and private key to the vehicle.
The TA’s registration process for the RSU also goes through the five steps described above. That is, the TA generates a random number as the system private key for the RSU. It then calculates its system public key , initial pseudonym , and fake ID . Finally, the TA stores and sends to .

4.3. Anonymous Authentication Based on Privacy Preserving

The authentication process takes place in the intercommunicating vehicle network entities. Its purpose is to prove the legitimacy of the communication entities and the integrity of the data in the transmission process. If the information is sent directly, there will be a risk of privacy disclosure. Therefore, anonymity is used to verify the legitimacy of the communication entity. Because the link time of each entity in the communication process is very short, if we can ensure the dynamic changes of various data, we can enhance the privacy. Therefore, the execution process of the algorithm coupled with a timeliness judgment validates the data in the timeliness range. Otherwise, the invalid data need to be recalculated and verified.

4.3.1. Generating Anonymous Certificates and Anonymous Signatures

In this algorithm, the legitimacy and data integrity of communication entities are realized by verifying certificates and signatures. In order to prove the legitimacy of the communication entity, the certificate verifies whether the sending entity has the legal identity. If it does not, it will proceed by verifying the signature and disconnecting from the communication entity. Signature verification confirms that the data are complete and untampered during the transmission. Therefore, before verifying the validity and data integrity, it is necessary to generate vehicle certificates and signatures. The anonymous vehicle certificates are generated through the steps in Algorithm 1.

Step 1. Vehicle uses the current time as the seed of random number to generate random number and calculates its authentication public key .
Step 2. Vehicle generates 3 random numbers and computes authentication parameters , , , , , and .
Step 3. Use authentication public key and authentication parameters and system parameter from function H to generate vehicle authentication verification code .
Step 4. Use , authentication public key, and pseudonym of vehicle to combine an anonymous certification .

Assuming that the data to be transmitted for vehicle is and expressed as , its anonymous signature is generated as follows:

Finally, vehicle proves its legitimacy by broadcasting messages , consisting of vehicle anonymous certificate, the anonymous signature, and the system public key:

4.3.2. Identity Verification

Other vehicles or RSUs that receive will verify the identity of the sender. The verification process is as follows:

Step 1. Separately calculate the following:

Step 2. Use parameters to generate a new verification code , as follows:

Step 3. Verify the validity of the identity of the vehicle sending the message by verifying whether is valid. The composition of and is compared, and it suffices to validate . The verification process is as follows:Therefore, is established and the legal identity of the vehicle is verified.

4.3.3. Verifying Data Integrity

The integrity of the transmitted data is ensured by verifying the signature. As such, the data are untampered. The receiver uses equation (11) to verify the integrity of the data. If equation (11) holds, the data are untampered, and the receiver receives the message. Otherwise, the message is rejected:

The process of checking this is as follows:

Therefore, the integrity of the data is verified, indicating that it has not been tampered with during the transmission process.

5. Pseudonym Changing Mechanism

In this section, we describe the proposed pseudonym changing mechanism in detail. We assume that each vehicle has a set of pseudonyms pregenerated by the TA. In addition, each pseudonym has a short duration, called the stable time. In other words, each vehicle has to change its pseudonym frequently. The model for the pseudonym changing mechanism is shown in Figure 4.

5.1. Resolved Problem

Even when vehicles change their pseudonyms, attackers can discover the relationship between the pseudonyms by various means. Consequently, the position of vehicles can be tracked. This attack is called a pseudonym linking attack, as shown Figure 5. To illustrate this, we consider a case with three vehicles (A, B, and C). If only vehicle B changes its pseudonym from B1 to B2 during , an attacker can discover that B1 and B2 are associated with B.

The proposed pseudonym changing mechanism prevents this type of attack by making it more difficult for the attacker to link pseudonyms. The main purpose of the proposed pseudonym changing mechanism is to determine where and when a vehicle should change its pseudonym [10].

5.2. Mix-Context-Based Cooperative Pseudonym Mechanism

In the proposed MPCPA, each vehicle decides independently where and when to change its pseudonym; in this way, each pseudonym has a stable time. Once this stable time expires, the vehicle is ready to change its pseudonym and is able to check whether the mix-context condition is satisfied. If this is the case, the vehicle changes its pseudonym immediately. Otherwise, the vehicle waits until the maximum wait time expires, at which time it must change its pseudonym. The mechanism is shown in Figure 6.

As shown in Figure 6, the mix-context condition is a substantial element in the proposed mechanism. Thus, we analyzed this condition in detail.

In VANETs, vehicles need to broadcast their beacons at the same time, and synchrony is achieved with GPS clocks. Therefore, we make use of these beacons by inserting two flags into each beacon, as shown in Figure 7.

Here, the wait-flag indicates whether a vehicle is waiting to change its pseudonym. If the wait-flag is 1, the vehicle is waiting to change its pseudonym. Otherwise, it is not. The ready-flag indicates whether the vehicle is ready to change its pseudonym during the next time slot. If the ready-flag is 1, the vehicle is ready to change its pseudonym. Both the wait-flag and ready-flag are initially set to 0.

In addition, the proposed MPCPA is a cooperative model. Each vehicle needs to construct a list of neighbors. Let denote the set of vehicles neighboring vehicle . The list of neighbors is generated by data received by the beacons.

When the stable time expires, the wait-flag is set to 1. The ready-flag is then set to 1 when the vehicle finds at least k neighboring vehicles with a wait-flag equal to 1 and , where L denotes the number of neighboring vehicles.

The conditions for changing a pseudonym are shown in Algorithm 2. The vehicle will change its pseudonym when at least k neighboring vehicles are ready to change their pseudonyms, or when one of neighboring vehicles has k or more neighbors ready to change their pseudonyms.

Output: pseudonym changing
  If then
  Vehicle υ changes the pseudonym
   for to N
    If then
    Vehicle υ changes the pseudonym
   End if
  End for
 End if

Specifically, is used to count the number of neighboring vehicles with a ready-flag equal to 1. When  = 3, for instance, there are three neighboring vehicles with a ready-flag equal to 1.

6. Performance Analysis

In this section, we analyze the performance of the proposed MPCPA.

6.1. Security Analysis

The proposed scheme satisfies anonymous vehicle authentication and privacy protection.

6.1.1. Anonymous Vehicle Authentication

As explained in Section 4.3 and detailed in Algorithm 1, a vehicle generates an anonymous certificate and an anonymous signature for message . Message contains a signature and a certificate. Vehicle is successfully authenticated only when equation (6) is satisfied.

6.1.2. Privacy Protection

The privacy of the vehicles is protected using a digital signature and the mix-context cooperative pseudonym changing mechanism, as detailed in Algorithm 2. Each vehicle has a set of pseudonyms, and a vehicle changes its pseudonym only when the mix-context conditions are satisfied. This mechanism protects vehicle privacy and prevents vehicles from being tracked.

6.2. Computation Cost and Verification Time of Anonymous Authentication

We selected two main evaluation metrics to evaluate the performance of the proposed authentication mechanism: the computation cost and the verification time. Both metrics reflect the complexity of the algorithm. The computation cost refers to the total amount of time required for the authentication process. In addition, we compared the performance of MPCPA to that of four well-known authentication mechanisms, viz., IBBV [11], GSCP [17], key-insulated pseudonym self-delegation (KPSD) [23], and secure authentication scheme for VANETs with batch verification (SABV) [24].

Let , , and denote the execution time for the pairing operation, hash operation, and multiplication operation, respectively. Accordingly, and are the execution time required for the exponentiation operations in and , respectively.

The total amount of consumed time for the various schemes is shown in Table 1. We can observe that our MPCPA algorithm outperforms existing schemes in terms of the computational cost. As such, the proposed scheme has a relatively fast execution time. In particular, for one certification and signature, MPCPA required only , , and for the verification process.

SchemeExecution time for operation

MPCPA(1 + n)tpnth(1 + n)te
GSCP(2 + 3n)tp2nth(n + 5)tm
KPSD(3 + n)tpnth(4 + n)te + 5nts
IBBV3ntp3nth(2n + 5)tm
SABV(2 + 3n)tpnthnte

Next, the verification time of MPCPA was compared to that of IBBV, GSCP, KPSD, and SABV. Figure 8 shows the results of this experiment. Indeed, with an increase in the number of received messages, the verification time will increase. Compared to IBBV, GSCP, KPSD, and SABV, the proposed MPCPA performed better in terms of the verification time. For example, with 120 received messages, our MPCPA algorithm required merely 600 ms to complete the verification process, whereas the other algorithms needed more than 900 ms.

6.3. Avoiding Pseudonym Linking Attacks

According to the above analysis, the purpose of the proposed pseudonym mechanism is to defend against attackers seeking to track vehicles and stealing private information with a pseudonym linking attack. In order to analyze the effectiveness of the proposed mechanism, the tracking model in [25] was introduced to determine the tracking probability.

We denote the number of vehicles ready to change their pseudonyms at by . According to a Poisson process, is distributed as follows:where the vehicles are uniformly distributed with rate .

When the stable time of the pseudonym expires, the vehicle is ready to change its pseudonym. Thus, we assume that at least one vehicle has changed its pseudonym. The probability that a new pseudonym will be linked to the same vehicle is derived as follows [26]:

Note that in Algorithm 2, parameter plays an important role in defending against a pseudonym linking attack. Therefore, the impact of parameter on the probability is relevant. Given that , Figure 9 shows tracking probabilities under different values. As shown in the figure, the probability drastically decreases as increases. This is expected. The more vehicles simultaneously changing their pseudonyms, the less likely they are to be tracked.

7. Conclusion and Future Work

In this paper, we proposed a privacy-preserving authentication scheme for secure communication in VANETs. The proposed MPCPA introduces an anonymous authentication mechanism to preserve the privacy of the vehicles. Furthermore, a mix-context-based cooperative pseudonym changing mechanism protects the location of vehicle users. The proposed authentication scheme is efficient in terms of its computational complexity. Our evaluation demonstrated that MPCPA greatly reduces computational overhead and provides an efficient means for preserving the privacy of vehicles.

In future research, we will study cooperative message verification and batch signature verification to reduce computational overhead further, and we will subject our scheme to extensive experimentation to verify its authentication scheme. It is noteworthy that the proposed MPCPA is not independent from the RSU. Consequently, we will consider ways of carrying out privacy preserving authentication without the need for the RSU.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.


This work was partly supported by Zhejiang Province Natural Science Foundation of China (LY18G020008, LQ18F020002), Zhejiang Province Soft Science Foundation of China (2019C35006), National Natural Science Foundation of China (61202290), Huzhou University’s Scientific Research Foundation in 2018 (2018XJKJ63), and Huzhou City Zhejiang Province Key Industry Project of China (2018GG29).


  1. X. Huang, M. Zeng, J. Fan, X. Fan, and X. Tang, “A full duplex D2D clustering resource allocation scheme based on a K-means algorithm,” Wireless Communications and Mobile Computing, vol. 2018, Article ID 1843083, 8 pages, 2018. View at: Publisher Site | Google Scholar
  2. H. Wang, H. Luo, and X. Liu, “Evidential reasoning method based on isometric mapping in internet of vehicular Ad-hoc NETworks,” System Engineering Theory and Practice, vol. 35, no. 6, pp. 1582–1595, 2015. View at: Google Scholar
  3. P. Vijayakumar, M. Azees, and L. Jegatha Deborah, “CPAV: computationally efficient privacy preserving anonymous authentication scheme for vehicular ad hoc networks,” in Proceedings of the 2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing, pp. 62–67, New York, NY, USA, November 2015. View at: Google Scholar
  4. S. S. Manvi and S. Tangade, “A survey on authentication schemes in VANETs for secured communication,” Vehicular Communications, vol. 9, no. 9, pp. 19–30, 2017. View at: Publisher Site | Google Scholar
  5. S. Yan, R. Malaney, I. Nevat, and G. W. Peters, “Location verification systems for VANETs in rician fading channels,” IEEE Transactions on Vehicular Technology, vol. 65, no. 7, pp. 5652–5664, 2016. View at: Publisher Site | Google Scholar
  6. C. Sun, J. Liu, X. Xu, and J. Ma, “A privacy-preserving mutual authentication resisting DoS attacks in VANETs,” IEEE Access, vol. 25, no. 5, pp. 24011–24022, 2017. View at: Publisher Site | Google Scholar
  7. M. Raya and J. Hubaux, “Securing vehicular ad hoc networks,” Journal of Computer Security, vol. 15, no. 1, pp. 39–68, 2007. View at: Publisher Site | Google Scholar
  8. R. Lu, X. Lin, and T. Luan, “Pseudonym changing at social spots: an effective strategy for location privacy in VANETs,” IEEE Transactions on Vehicular Technology, vol. 61, no. 1, pp. 86–96, 2012. View at: Publisher Site | Google Scholar
  9. P. Papadimitratos, L. Buttyan, and T. Holczer, “Secure vehicular communication systems: design and architecture,” IEEE Communications, vol. 46, no. 11, pp. 100–109, 2018. View at: Google Scholar
  10. A. Boualouache, S. M. Senouci, and M. Samira, “A survey on pseudonym changing strategies for Vehicular Ad-Hoc Networks,” IEEE Communications Surveys and Tutorials, vol. 3, no. 7, pp. 1–21, 2017. View at: Google Scholar
  11. C. Zhang, R. Lu, and X. Lin, “An efficient identity-based batch verification scheme for vehicular sensor networks,” Proceedings of IEEE infocom, pp. 816–824, 2008. View at: Google Scholar
  12. K.-A. Shim, “${\cal CPAS}$: an efficient conditional privacy-preserving authentication scheme for vehicular sensor networks,” IEEE Transactions on Vehicular Technology, vol. 61, no. 4, pp. 1874–1883, 2012. View at: Publisher Site | Google Scholar
  13. T. Thenmozhi and R. M. Somasundaram, “Pseudonyms based blind signature approach for an improved secured communication at social spots in VANETs,” Wireless Personal Communications, vol. 82, no. 1, pp. 643–658, 2015. View at: Publisher Site | Google Scholar
  14. P. Vijayakumar, V. Chang, L. Jegatha Deborah, B. Balusamy, and P. G. Shynu, “Computationally efficient privacy preserving anonymous mutual and batch authentication schemes for vehicular ad hoc networks,” Future Generation Computer Systems, vol. 78, pp. 943–955, 2018. View at: Publisher Site | Google Scholar
  15. S. H. Islam, M. S. Obaidat, P. Vijayakumar, E. Abdulhay, F. Li, and M. K. C. Reddy, “A robust and efficient password-based conditional privacy preserving authentication and group-key agreement protocol for VANETs,” Future Generation Computer Systems, vol. 84, pp. 216–227, 2018. View at: Publisher Site | Google Scholar
  16. M. Azees, P. Vijayakumar, and L. J. Deboarh, “EAAP: efficient anonymous authentication with conditional privacy-preserving scheme for vehicular ad hoc networks,” IEEE Transactions on Intelligent Transportation Systems, vol. 18, no. 9, pp. 2467–2476, 2017. View at: Publisher Site | Google Scholar
  17. J. Freudiger, M. H. Manshaei, J.-P. Hubaux, and D. C. Parkes, “Non-cooperative location privacy,” IEEE Transactions on Dependable and Secure Computing, vol. 10, no. 2, pp. 84–98, 2013. View at: Publisher Site | Google Scholar
  18. B. Ying, D. Makrakis, and Z. Hou, “Motivation for protecting selfish vehicles' location privacy in vehicular networks,” IEEE Transactions on Vehicular Technology, vol. 64, no. 12, pp. 5631–5641, 2015. View at: Publisher Site | Google Scholar
  19. Y. Pan, J. Li, L. Feng, and B. Xu, “An analytical model for random pseudonym change scheme in VANETs,” Cluster Computing, vol. 17, no. 2, pp. 413–421, 2014. View at: Publisher Site | Google Scholar
  20. D. Eckhoff, C. Sommer, and T. Gansen, “Strong and affordable location privacy in VANETs: identity diffusion using time-slots and swapping,” in IEEE Vehicular Networking Conference, pp. 174–181, Jersey City, NJ, USA, December 2016. View at: Google Scholar
  21. V. Pandi, A. Maria, and V. Chang, “Computationally efficient privacy preserving authentication and key distribution techniques for vehicular ad hoc networks,” Cluster Computing, vol. 20, no. 3, pp. 2439–2450, 2017. View at: Publisher Site | Google Scholar
  22. D. Boneh, B. Lynn, and H. Shacham, “Short signatures from the Weil pairing,” Journal of Cryptology, vol. 17, no. 4, pp. 297–319, 2004. View at: Publisher Site | Google Scholar
  23. R. Lu, X. Lin, and T. H. Luan, “Pseudonym changing at social spots: an effective strategy for location privacy in VANET,” IEEE Transaction on Vehicle Technology, vol. 61, no. 1, pp. 86–96, 2012. View at: Publisher Site | Google Scholar
  24. M. Bayat, M. Barmshoory, M. Rahimi, and M. R. Aref, “A secure authentication scheme for VANETs with batch verification,” Wireless Networks, vol. 21, no. 5, pp. 1733–1743, 2015. View at: Publisher Site | Google Scholar
  25. K. Sampigethaya, M. Li, and L. Huang, “AMOEBA: robust location privacy scheme for vanet,” IEEE Journal of Selected Area in Communications, vol. 25, no. 8, pp. 1569–1589, 2016. View at: Publisher Site | Google Scholar
  26. H. Xu, “Proxy re-encryption-based secure location service in VANETs,” Journal of Chongqing University of Posts and Telecommunications (Natural Science Edition), vol. 30, no. 6, pp. 835–841, 2018. View at: Google Scholar

Copyright © 2019 Mengjia Zeng and Huibin Xu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

More related articles

592 Views | 288 Downloads | 1 Citation
 PDF  Download Citation  Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.