skip to main content
10.1145/1866855.1866862acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
research-article

Efficient CRL search in vehicular network PKIS

Published:08 October 2010Publication History

ABSTRACT

We investigate privacy-preserving Public-Key Infrastructures (PKIs) with additional security, privacy, and performance requirements meant to support vehicular networks. While conventional PKIs are a cornerstone for identity management in certain security applications, they do not offer the privacy properties that vehicular networks demand. Over the last few years, there have been efforts to generalize conventional PKIs to meet these new privacy and security demands. One particular example is the class of multiple certificate PKIs where each vehicle is given multiple short-lived and anonymous certificates that can function as credentials until the vehicle is due for, say, the next inspection or dealership visit. While such PKIs offer attractive security and privacy properties, achieving acceptable performance has remained an open problem thus questioning their practicality.

In this paper, we formally define and investigate the efficient certificate revocation list (CRL) search problem for multiple certificate PKIs, which asks whether it is possible to efficiently test CRL membership of a given certificate in the same order of computational complexity as in conventional PKIs (that is, by a simple and fast binary search over the set of revoked PKI members). Any solution to this problem is of particular interest when it does not introduce unacceptable compromises on other important properties such as security and privacy. We start by formally defining vehicular networks and a number of security, privacy and performance requirements for them. Then we demonstrate that for PKIs based on general classes of efficient algorithms, containing binary search over totally ordered sets and approximate nearest neighbor search over metric spaces, a solution to the efficient CRL search problem can be used to violate privacy. Finally, we present and analyze new solutions that simultaneously solve the efficient cRL search problem and satisfy privacy requirements by allowing all vehicles to locally (i.e., with minimal help from the CA) and consistently (i.e., with the same results across all vehicles) manage their CRLs. Using these ideas, we can maintain security and privacy properties while reducing the CRL membership testing time to logarithmic in the number of revoked vehicles, which is essentially the same performance that one obtains with conventional PKIs where privacy is not required.

References

  1. }}http://ivc.ep.ch/.Google ScholarGoogle Scholar
  2. }}http://en.wikipedia.org/wiki/Vehicle-infrastructure-integration.Google ScholarGoogle Scholar
  3. }}http://www.traficviolationlawfirms.com/Statistics.cfm.Google ScholarGoogle Scholar
  4. }}Bibliography on secure vehicular communications. http://bbcr.uwaterloo.ca/ rxlu/sevecombib.htm.Google ScholarGoogle Scholar
  5. }}M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In CRYPTO, pages 1--15, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. }}J. Y. Choi, M. Jakobsson, and S. Wetzel. Balancing auditability and privacy in vehicular networks. In Q2SWinet, pages 79--87, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. }}G. DiCrescenzo, T. Zhang, and S. Pietrowicz. Anonymity notions for public-key infrastructures in vehicular networks. In IEEE International Conference on Mobile, Ad-hoc and Sensor Systems (MASS), pages 1--6, 2007.Google ScholarGoogle Scholar
  8. }}W. Diffle and M. Hellmann. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6), 1976.Google ScholarGoogle Scholar
  9. }}R. H. Eric Rescorla, John Kelsey and D. Whiting. Vehicle safety communications consortium, final report to national highway traffic safety administration of the us department of transportation, appendix h: Wave/dsrc security. April 2006.Google ScholarGoogle Scholar
  10. }}O. Goldreich. Foundations of cryptography: a primer. Found. Trends Theor. Comput. Sci., 1(1):1--116, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. }}O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. J. ACM, 33(4):792--807, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. }}F. Kargl, P. Papadimitratos, L. Buttyán, M. Muter, B. Wiedersheim, E. Schoch, T.-V. Thong, G. Calandriello, A. Held, A. Kung, and J.-P. Hubaux. Secure vehicular communication systems: Implementation, performance, and research challenges. CoRR, abs/0912.5393, 2009.Google ScholarGoogle Scholar
  13. }}X. Lin, R. Lu, C. Zhang, H. Zhu, P.-H. Ho, and X. S. Shen. Security in vehicular ad hoc networks. IEEE Communications Magazine, April 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. }}G. T. M. El Zarki, S. Mehrotra and N. Venkatasubramanian. Security issues in a future vehicular network. In European Wireless, February 2002.Google ScholarGoogle Scholar
  15. }}P. Papadimitratos and A. Kung. Privacy and identity management for vehicular communication systems: A position paper. In In Proceedings of Workshop on Standards for Privacy in User-Centric Identity Management, 2006.Google ScholarGoogle Scholar
  16. }}S. Pietrowicz, H. Shim, G. DiCrescenzo, and T. Zhang. Vdtls - providing secure communications in vehicle networks. In IEEE Infocom Workshops, pages 1--6, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  17. }}M. Raya and J.-P. Hubaux. The security of vehicular ad hoc networks. In ACM CCS SASN Workshop, pages 11--21, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. }}M. Raya and J.-P. Hubaux. Securing vehicular ad hoc networks. Journal of Computer Security, 15(1):39--68, 2007. Google ScholarGoogle ScholarCross RefCross Ref
  19. }}B. Schneier. Applied cryptography (2nd ed.): protocols, algorithms, and source code in C. John Wiley & Sons, Inc., New York, NY, USA, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. }}R. G. White, S. Pietrowicz, E. van den Berg, G. DiCrescenzo, D. Mok, R. Ferrer, T. Zhang, and H. Shim. Privacy and scalability analysis of vehicular combinatorial certificate schemes. In 6th IEEE Conference on Consumer Communications and Networking Conference, pages 624--628, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Efficient CRL search in vehicular network PKIS

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          DIM '10: Proceedings of the 6th ACM workshop on Digital identity management
          October 2010
          70 pages
          ISBN:9781450300902
          DOI:10.1145/1866855

          Copyright © 2010 ACM

          Permission to make digital or hard copies of all or part 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, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 8 October 2010

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          DIM '10 Paper Acceptance Rate8of16submissions,50%Overall Acceptance Rate16of34submissions,47%

          Upcoming Conference

          CCS '24
          ACM SIGSAC Conference on Computer and Communications Security
          October 14 - 18, 2024
          Salt Lake City , UT , USA

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader