PPREM: Privacy Preserving REvocation Mechanism for Vehicular Ad Hoc Networks
TL;DR: A Privacy Preserving Revocation mechanism (PPREM) based on a universal one-way accumulator provides explicit, concise, authenticated and unforgeable information about the revocation status of each certificate while preserving the users' privacy.
About: This article is published in Computer Standards & Interfaces.The article was published on 2014-03-01. It has received 30 citations till now. The article focuses on the topics: Vehicular ad hoc network & Revocation.
Citations
More filters
TL;DR: The general secure process and point out authentication methods involved in these processes involved in VANETs are presented and detailed survey of these authentication algorithms followed by discussions comes afterward.
Abstract: Vehicular ad hoc networks (VANETs) have stimulated interest in both academic and industry settings because, once deployed, they would bring a new driving experience to drivers. However, communicating in an open-access environment makes security and privacy issues a real challenge, which may affect the large-scale deployment of VANETs. Researchers have proposed many solutions to these issues. We start this paper by providing background information of VANETs and classifying security threats that challenge VANETs. After clarifying the requirements that the proposed solutions to security and privacy problems in VANETs should meet, on the one hand, we present the general secure process and point out authentication methods involved in these processes. Detailed survey of these authentication algorithms followed by discussions comes afterward. On the other hand, privacy preserving methods are reviewed, and the tradeoff between security and privacy is discussed. Finally, we provide an outlook on how to detect and revoke malicious nodes more efficiently and challenges that have yet been solved.
373 citations
TL;DR: An efficient decentralized public key infrastructure (PKI) using the concepts of Bayesian Coalition Game (BCG) and Learning Automata (LA) and the results obtained prove the superiority of the proposed scheme.
99 citations
Cites background from "PPREM: Privacy Preserving REvocatio..."
...But due to high mobility and temporary certificates with vehicles called as pseudonyms, creation and maintenance of dynamic CRLs is also another challenging task in this environment [6]....
[...]
...If any misbehavior is observed from any node in the network, then the issued certificate is revoked and Certificate Revocation List (CRL) is constructed for all such nodes [6]....
[...]
...[6] proposed privacy preserving mechanism with certificate revocation in VANETs....
[...]
TL;DR: How the research reflects the evolutionary growth of security attacks with its future prophesy, based upon the past developments in the area of computer security is discussed.
90 citations
TL;DR: By simulation results, it is proved that the proposed trust-based authentication scheme for cluster-based VANETs provides high security with less overhead and delay.
Abstract: Since Vehicular ad hoc networks (VANETs) are vulnerable to various kinds of attacks, there is a need to fulfill the security requirements like message privacy, integrity, and authentication. The authentication technique is said to be efficient if it detects compromised nodes accurately with less complexity, reduced authentication delay, and keying overhead. In this paper, a trust-based authentication scheme for cluster-based VANETs is proposed. The vehicles are clustered, and the trust degree of each node is estimated. The trust degree is a combination of direct trust degree and indirect trust degree. Based on this estimated trust degree, cluster heads are selected. Then, each vehicle is monitored by a set of verifiers, and the messages are digitally signed by the sender and encrypted using a public/ private key as distributed by a trusted authority and decrypted by the destination. This verifies the identity of sender as well as receiver thus providing authentication to the scheme. By simulation results, we prove that the proposed technique provides high security with less overhead and delay.
76 citations
01 Dec 2014
TL;DR: This work proposes PUCA - a scheme that provides full anonymity, even against colluding backend providers, until the owner of a vehicle triggers revocation himself, while still allowing revocation of long-term credentials.
Abstract: Envisioned vehicular ad-hoc networks (VANET) standards use pseudonym certificates to provide secure and privacy-friendly message authentication. Revocation of long-term credentials is required to remove participants from the system, e.g. in case of vehicle theft. However, the current approach to revocation puts the users' privacy at risk if the backend systems are not fully trusted. We propose PUCA — a scheme that provides full anonymity, even against colluding backend providers, until the owner of a vehicle triggers revocation himself. The scheme uses anonymous credentials for authentication with the backend while leaving the communication among vehicles and with road side units unchanged and in compliance with existing standards. With PUCA, we put drivers back in charge of their privacy while still allowing revocation of long-term credentials.
44 citations
References
More filters
TL;DR: A method called “affinity propagation,” which takes as input measures of similarity between pairs of data points, which found clusters with much lower error than other methods, and it did so in less than one-hundredth the amount of time.
Abstract: Clustering data by identifying a subset of representative examples is important for processing sensory signals and detecting patterns in data. Such "exemplars" can be found by randomly choosing an initial subset of data points and then iteratively refining it, but this works well only if that initial choice is close to a good solution. We devised a method called "affinity propagation," which takes as input measures of similarity between pairs of data points. Real-valued messages are exchanged between data points until a high-quality set of exemplars and corresponding clusters gradually emerges. We used affinity propagation to cluster images of faces, detect genes in microarray data, identify representative sentences in this manuscript, and identify cities that are efficiently accessed by airline travel. Affinity propagation found clusters with much lower error than other methods, and it did so in less than one-hundredth the amount of time.
6,429 citations
TL;DR: This work proposes a fully functional identity-based encryption (IBE) scheme based on bilinear maps between groups and gives precise definitions for secure IBE schemes and gives several applications for such systems.
Abstract: We propose a fully functional identity-based encryption (IBE) scheme. The scheme has chosen ciphertext security in the random oracle model assuming a variant of the computational Diffie--Hellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic curves is an example of such a map. We give precise definitions for secure IBE schemes and give several applications for such systems.
5,110 citations
15 Aug 2004
TL;DR: In this article, the authors proposed a group signature scheme based on the Strong Diffie-Hellman assumption and a new assumption in bilinear groups called the Decision Linear assumption.
Abstract: We construct a short group signature scheme. Signatures in our scheme are approximately the size of a standard RSA signature with the same security. Security of our group signature is based on the Strong Diffie-Hellman assumption and a new assumption in bilinear groups called the Decision Linear assumption. We prove security of our system, in the random oracle model, using a variant of the security definition for group signatures recently given by Bellare, Micciancio, and Warinschi.
1,956 citations
PARC1
TL;DR: A practical digital signature system based on a conventionalryption function which is as secure as the conventional encryption function is described, without the several years delay required for certification of an untested system.
Abstract: A practical digital signature system based on a conventional encryption function which is as secure as the conventional encryption function is described. Since certified conventional systems are available it can be implemented quickly, without the several years delay required for certification of an untested system.
1,746 citations
Journal Article•
TL;DR: In this paper, the authors proposed a group signature scheme based on the Strong Diffie-Hellman assumption and a new assumption in bilinear groups called the Decision Linear assumption.
Abstract: We construct a short group signature scheme. Signatures in our scheme are approximately the size of a standard RSA signature with the same security. Security of our group signature is based on the Strong Diffie-Hellman assumption and a new assumption in bilinear groups called the Decision Linear assumption. We prove security of our system, in the random oracle model, using a variant of the security definition for group signatures recently given by Bellare, Micciancio, and Warinschi.
1,562 citations