Literature Database Entry

eckhoff2013smartrevoc


David Eckhoff, Falko Dressler and Christoph Sommer, "SmartRevoc: An Efficient and Privacy Preserving Revocation System Using Parked Vehicles," Proceedings of 38th IEEE Conference on Local Computer Networks (LCN 2013), Sydney, Australia, October 2013, pp. 855-862.

Abstract

Security and privacy requirements in vehicular networks are commonly addressed using a Public Key Infrastructure (PKI) and pools of pseudonymous certificates for each vehicle. Messages are signed with these certificates, so that misbehaving vehicles can be excluded from the network by disseminating Certificate Revocation Lists (CRLs). We present SmartRevoc, a novel revocation architecture, to solve the main challenges of CRL distribution in vehicular networks: CRL size, dissemination speed, and preservation of location privacy. Using two hash chains, we compute CRLs on vehicles, substantially reducing communication overhead. At the same time our design is privacy preserving, preventing the linking of past pseudonyms to revoked ones. We additionally utilize parked vehicles to epidemically disseminate CRLs and show that even few parked vehicles can outperform an unreasonably high number of Roadside Units (RSUs). Our simulation results clearly indicate that SmartRevoc is a major step forward toward more efficient and secure vehicular networks.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

David Eckhoff
Falko Dressler
Christoph Sommer

BibTeX reference

@inproceedings{eckhoff2013smartrevoc,
    author = {Eckhoff, David and Dressler, Falko and Sommer, Christoph},
    title = {{SmartRevoc: An Efficient and Privacy Preserving Revocation System Using Parked Vehicles}},
    booktitle = {38th IEEE Conference on Local Computer Networks (LCN 2013)},
    pages = {855-862},
    year = {2013},
    month = {October},
    address = {Sydney, Australia},
    publisher = {IEEE},
    doi = {10.1109/LCN.2013.6761338},
   }
   
   

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 proceeedings 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 permissions@acm.org.

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

This page was automatically generated using BibDB and bib2web.