Results 1 - 10
of
57
An Efficient Pseudonymous Authentication Scheme with Strong Privacy Preservation for Vehicular Communications
"... Abstract—In this paper, we propose an efficient pseudonymous authentication scheme with strong privacy preservation, named PASS, for vehicular communications. Unlike traditional pseudonymous authentication schemes, the size of Certificate Revocation List (CRL) in PASS is linear with the number of re ..."
Abstract
-
Cited by 32 (7 self)
- Add to MetaCart
Abstract—In this paper, we propose an efficient pseudonymous authentication scheme with strong privacy preservation, named PASS, for vehicular communications. Unlike traditional pseudonymous authentication schemes, the size of Certificate Revocation List (CRL) in PASS is linear with the number of revoked vehicles and irrelated to how many pseudonymous certificates are held by the revoked vehicles. PASS supports Roadside Unitsaided distributed certificate service that allows the vehicles to update certificates on road, but the service overhead is almost irrelated to the number of the updated certificates. Furthermore, PASS provides strong privacy preservation to the vehicles so that the adversaries can not trace any vehicle even all Roadside Units have been compromised. Extensive simulations demonstrate that PASS outperforms previously reported ones in terms of the revocation cost and the certificate updating overhead. Index Terms—Vehicular communications, privacy preservation, anonymous authentication, revocation I.
Pseudonym Changing at Social Spots: An Effective Strategy for Location Privacy in VANETs
"... in vehicular ad hoc networks (VANETs), location privacy is imperative for the full flourish of VANETs. 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. ..."
Abstract
-
Cited by 32 (15 self)
- Add to MetaCart
(Show Context)
in vehicular ad hoc networks (VANETs), location privacy is imperative for the full flourish of VANETs. 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. Specifically, we first introduce the social spots where many 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 (ASS) as the location privacy metric, we then develop two anonymity set analytic models to quantitatively investigate the location privacy achieved by the PCS strategy. In addition, we use game theoretic techniques to prove the feasibility of 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 the proposed PCS strategy can assist vehicles to intelligently change their pseudonyms at the right moment and place.
Pi: A Practical Incentive Protocol for Delay Tolerant Networks
"... Abstract—Delay Tolerant Networks (DTNs) are a class of networks characterized by lack of guaranteed connectivity, typically low frequency of encounters between DTN nodes and long propagation delays within the network. As a result, the message propagation process in DTNs follows a store-carryand-forw ..."
Abstract
-
Cited by 24 (5 self)
- Add to MetaCart
Abstract—Delay Tolerant Networks (DTNs) are a class of networks characterized by lack of guaranteed connectivity, typically low frequency of encounters between DTN nodes and long propagation delays within the network. As a result, the message propagation process in DTNs follows a store-carryand-forward manner, and the in-transit bundle messages can be opportunistically routed towards the destinations through intermittent connections under the hypothesis that each individual DTN node is willing to help with forwarding. Unfortunately, there may exist some selfish nodes, especially in a cooperative network likeDTN,andthepresenceofselfish DTN nodes could cause catastrophic damage to any well designed opportunistic routing scheme and jeopardize the whole network. In this paper, to address the selfishness problem in DTNs, we propose a practical incentive protocol, called Pi, such that when a source node sends a bundle message, it also attaches some incentive on the bundle, which is not only attractive but also fair to all participating DTN nodes. With the fair incentive, the selfish DTN nodes couldbestimulatedtohelpwithforwardingbundlestoachieve better packet delivery performance. In addition, the proposed Pi protocol can also thwart various attacks, which could be launched by selfish DTN nodes, such as free ride attack, layer removing and adding attacks. Extensive simulation results demonstrate the effectiveness of the proposed Pi protocol in terms of high delivery ratio and lower average delay. Index Terms—Delay tolerant networks, selfish node, fairness, practical incentive. I.
An Efficient Identity-based Batch Verification Scheme for Vehicular Sensor Networks
"... Abstract—With the adoption of state-of-the-art telecommu-nication technologies for sensing and collecting traffic related information, Vehicular Sensor Networks (VSNs) have emerged as a new application scenario that is envisioned to revolutionize the human driving experiences and traffic flow contro ..."
Abstract
-
Cited by 22 (3 self)
- Add to MetaCart
(Show Context)
Abstract—With the adoption of state-of-the-art telecommu-nication technologies for sensing and collecting traffic related information, Vehicular Sensor Networks (VSNs) have emerged as a new application scenario that is envisioned to revolutionize the human driving experiences and traffic flow control systems. To avoid any possible malicious attack and resource abuse, employing a digital signature scheme is widely recognized as the most effective approach for VSNs to achieve authentication, integrity, and validity. However, when the number of signatures received by a Roadside Unit (RSU) becomes large, a scalability problem emerges immediately, where the RSU could be diffi-cult to sequentially verify each received signature within 300 ms interval according to the current Dedicated Short Range Communications (DSRC) broadcast protocol. In this paper, we introduce an efficient batch signature verification scheme for communications between vehicles and RSUs (or termed vehicle-to-Infrastructure (V2I) communications), in which an RSU can verify multiple received signatures at the same time such that the total verification time can be dramatically reduced. We demonstrate that the proposed scheme can achieve conditional privacy preservation that is essential in VSNs, where each mes-sage launched by a vehicle is mapped to a distinct pseudo identity, while a trust authority can always retrieve the real identity of a vehicle from any pseudo identity. With the proposed scheme, since identity-based cryptography is employed in generating private keys for pseudo identities, certificates are not needed and thus transmission overhead can be significantly reduced. I.
An Efficient Message Authentication Scheme for Vehicular Communications
"... Abstract—In this paper, we introduce a novel roadside unit (RSU)-aided message authentication scheme named RAISE, which makes RSUs responsible for verifying the authenticity of messages sent from vehicles and for notifying the results back to vehicles. In addition, RAISE adopts the k-anonymity prope ..."
Abstract
-
Cited by 20 (3 self)
- Add to MetaCart
Abstract—In this paper, we introduce a novel roadside unit (RSU)-aided message authentication scheme named RAISE, which makes RSUs responsible for verifying the authenticity of messages sent from vehicles and for notifying the results back to vehicles. In addition, RAISE adopts the k-anonymity property for preserving user privacy, where a message cannot be associated with a common vehicle. In the case of the absence of an RSU, we further propose a supplementary scheme, where vehicles would cooperatively work to probabilistically verify only a small percentage of these message signatures based on their own computing capacity. Extensive simulations are conducted to validate the proposed scheme. It is demonstrated that RAISE yields a much better performance than previously reported counterparts in terms of message loss ratio (LR) and delay. Index Terms—Cooperation, privacy, security, vehicular communications.
BAT: A Robust Signature Scheme for Vehicular Networks Using Binary Authentication Tree
"... Abstract—In this paper, we propose a robust and efficient signature scheme for Vehicle-to-Infrastructure communications, called Binary Authentication Tree (BAT). The BAT scheme can effectively eliminate the performance bottleneck when verifying a mass of signatures within a rigorously required inter ..."
Abstract
-
Cited by 11 (4 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper, we propose a robust and efficient signature scheme for Vehicle-to-Infrastructure communications, called Binary Authentication Tree (BAT). The BAT scheme can effectively eliminate the performance bottleneck when verifying a mass of signatures within a rigorously required interval, even under adverse scenarios with bogus messages. Given any n received messages with k ≥ 1 bogus ones, the computation cost to verify all these messages only requires approximately (k +1) · log(n/k) +4k − 2 time-consuming pairing operations. The BAT scheme can also be gracefully transplanted to other similar batch signature schemes. In addition, it offers the other conventional security for vehicular networks, such as identity privacy and traceability. Theoretical analysis and simulation results demonstrate the validity and practicality of the BAT scheme. Index Terms—Binary authentication tree, identity-based cryptography, robust, signature, vehicular communication. I.
A Dynamic Privacy-Preserving Key Management Scheme for Location Based Services in VANETs
"... Abstract—In this paper, for achieving vehicle user’s privacy preservation while improving key update efficiency of location based services (LBSs) in vehicular ad hoc networks (VANETs), we propose a dynamic privacy-preserving key management scheme, called DIKE. Specifically, in the proposed DIKE sche ..."
Abstract
-
Cited by 10 (5 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper, for achieving vehicle user’s privacy preservation while improving key update efficiency of location based services (LBSs) in vehicular ad hoc networks (VANETs), we propose a dynamic privacy-preserving key management scheme, called DIKE. Specifically, in the proposed DIKE scheme, we first introduce a privacy-preserving authentication technique which not only provides vehicle user’s anonymous authentication but also enables double-registration detection. We then present efficient LBS session key update procedures: i) we divide the session of a LBS into several time slots so that each time slot holds a different session key, when no vehicle user departs from the service session, each joined user can use one-way hash function to autonomously update the new session key for achieving forwardsecrecy; and ii) we also integrate a novel dynamic threshold technique in traditional V-2-V and V-2-I communications for achieving session key’s backward-secrecy, i.e., when a vehicle user departs from the service session, more than a threshold number of joined users can cooperatively update the new session key. Performance evaluations via extensive simulations demonstrate the efficiency and effectiveness of the proposed DIKE scheme in terms of low key update delay and fast key update ratio. Index Terms—VANETs, secure location based services, dynamic key management, privacy preserving I.
An Intelligent Secure and Privacy-Preserving Parking Scheme Through Vehicular Communications
"... Abstract—There are always frustrations for drivers in finding parking spaces and being protected from auto theft. In this paper, to minimize the drivers ’ hassle and inconvenience, we propose a new intelligent secure privacy-preserving parking scheme through vehicular communications. The proposed sc ..."
Abstract
-
Cited by 10 (3 self)
- Add to MetaCart
Abstract—There are always frustrations for drivers in finding parking spaces and being protected from auto theft. In this paper, to minimize the drivers ’ hassle and inconvenience, we propose a new intelligent secure privacy-preserving parking scheme through vehicular communications. The proposed scheme is characterized by employing parking lot RSUs to surveil and manage the whole parking lot and is enabled by communication between vehicles and the RSUs. Once vehicles that are equipped with wireless communication devices, which are also known as onboard units, enter the parking lot, the RSUs communicate with them and provide the drivers with real-time parking navigation service, secure intelligent antitheft protection, and friendly parking information dissemination. In addition, the drivers ’ privacy is not violated. Performance analysis through extensive simulations demonstrates the efficiency and practicality of the proposed scheme. Index Terms—Antitheft, information dissemination, navigation, security and privacy, smart parking, vehicular ad hoc networks
An identity-based security system for user privacy in vehicular ad hoc networks
- Parallel and Distributed Systems, IEEE Transactions on
, 2010
"... Abstract—Vehicular ad hoc network (VANET) can offer various services and benefits to users and thus deserves deployment effort. Attacking and misusing such network could cause destructive consequences. It is therefore necessary to integrate security requirements into the design of VANETs and defend ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
Abstract—Vehicular ad hoc network (VANET) can offer various services and benefits to users and thus deserves deployment effort. Attacking and misusing such network could cause destructive consequences. It is therefore necessary to integrate security requirements into the design of VANETs and defend VANET systems against misbehavior, in order to ensure correct and smooth operations of the network. In this paper, we propose a security system for VANETs to achieve privacy desired by vehicles and traceability required by law enforcement authorities, in addition to satisfying fundamental security requirements including authentication, nonrepudiation, message integrity, and confidentiality. Moreover, we propose a privacy-preserving defense technique for network authorities to handle misbehavior in VANET access, considering the challenge that privacy provides avenue for misbehavior. The proposed system employs an identity-based cryptosystem where certificates are not needed for authentication. We show the fulfillment and feasibility of our system with respect to the security goals and efficiency.
EDR: Efficient Decentralized Revocation Protocol for Vehicular Ad Hoc Networks
"... Abstract—It is well recognized that security is vital for the reliable operation of vehicular ad hoc networks (VANETs). One of the critical security issues is the revocation of misbehaving vehicles, which is essential for the prevention of malicious vehicles from jeopardizing the safety of other veh ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
(Show Context)
Abstract—It is well recognized that security is vital for the reliable operation of vehicular ad hoc networks (VANETs). One of the critical security issues is the revocation of misbehaving vehicles, which is essential for the prevention of malicious vehicles from jeopardizing the safety of other vehicles. In this paper, we propose an efficient decentralized revocation (EDR) protocol based on a novel pairing-based threshold scheme and a probabilistic key distribution technique. Because of the decentralized nature of the EDR protocol, it enables a group of legitimate vehicles to perform fast revocation of a nearby misbehaving vehicle. Consequently, the EDR protocol improves the safety levels in VANETs as it diminishes the revocation vulnerability window existing in conventional certificate revocation lists (CRLs). By conducting detailed performance evaluation, the EDR protocol is demonstrated to be reliable, efficient, and scalable. Index Terms—Ad hoc, decentralized, revocation protocol, vehicular networks. I.
