Literature Database Entry


Carlos Gañán, Jose L. Muñoz, Oscar Esparza, Jorge Mata-Díaz and Juanjo Alins, "EPA: An efficient and privacy-aware revocation mechanism for vehicular ad hoc networks," Elsevier Pervasive and Mobile Computing, vol. 21, August 2014.


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. While essential, revocation checking can leak private information. In particular, repositories receiving the certificate status queries could infer the identity of the vehicles posing the query and the target of the query. An important loss of privacy results from this ability to tie the checking vehicle with the query’s target, due to their likely willingness to communicate. In this paper, we propose an Efficient and (MHT), Privacy-Aware revocation Mechanism (EPA) based on the use of Merkle Hash Trees and a Crowds-based anonymous protocol, which replaces the time-consuming certificate revocation lists checking process. EPA provides explicit, concise, authenticated and unforgeable information about the revocation status of each certificate while preserving the users’ privacy. Moreover, EPA reduces the security overhead for certificate status checking, and availability, enhances the and usability of the revocation data. By conducting a detailed performance evaluation, EPA is demonstrated to be reliable, efficient, and scalable.,

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


Carlos Gañán
Jose L. Muñoz
Oscar Esparza
Jorge Mata-Díaz
Juanjo Alins

BibTeX reference

    author = {Ga{\~{n}}{\'{a}}n, Carlos and Mu{\~{n}}oz, Jose L. and Esparza, Oscar and Mata-D{\'{i}}az, Jorge and Alins, Juanjo},
    doi = {10.1016/j.pmcj.2014.01.002},
    issn = {1574-1192},
    journal = {Elsevier Pervasive and Mobile Computing},
    month = {8},
    publisher = {Elsevier},
    title = {{EPA: An efficient and privacy-aware revocation mechanism for vehicular ad hoc networks}},
    volume = {21},
    year = {2014},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.