5th International ICST Conference on Communications and Networking in China

Research Article

NEHCM: A Novel and Efficient Hash-chain based Certificate Management scheme for vehicular communications

Download341 downloads
  • @INPROCEEDINGS{10.4108/chinacom.2010.88,
        author={Yipin Sun and Rongxing Lu and Xiaodong Lin and Jinshu Su and Xuemin (Sherman) Shen},
        title={NEHCM: A Novel and Efficient Hash-chain based Certificate Management scheme for vehicular communications},
        proceedings={5th International ICST Conference on Communications and Networking in China},
        publisher={IEEE},
        proceedings_a={CHINACOM},
        year={2011},
        month={1},
        keywords={Vehicular communications Privacy preservation Certificate Management Hash chain},
        doi={10.4108/chinacom.2010.88}
    }
    
  • Yipin Sun
    Rongxing Lu
    Xiaodong Lin
    Jinshu Su
    Xuemin (Sherman) Shen
    Year: 2011
    NEHCM: A Novel and Efficient Hash-chain based Certificate Management scheme for vehicular communications
    CHINACOM
    ICST
    DOI: 10.4108/chinacom.2010.88
Yipin Sun1,2,*, Rongxing Lu2,*, Xiaodong Lin3,*, Jinshu Su1,*, Xuemin (Sherman) Shen2,*
  • 1: School of Computer Science, National University of Defense Technology, Changsha, Hunan, P.R. China 410073
  • 2: Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
  • 3: Faculty of Business and Information Technology, University of Ontario Institute of Technology, Oshawa, Canada
*Contact email: ypsun@bbcr.uwaterloo.ca, rxlu@bbcr.uwaterloo.ca, Xiaodong.Lin@uoit.ca, sjs@nudt.edu.cn, xshen@bbcr.uwaterloo.ca

Abstract

In this paper, we propose a Novel and Efficient Hash-chain based Certificate Management (NEHCM) scheme for vehicular communications. In NEHCM, to protect driver privacy, each vehicle is equipped with a large set of short-time certificates, and most importantly, serial numbers of these certificates satisfy hash-chain relationship. As a result, the certificate revocation becomes an easy task by simply releasing two hash chain seeds. However, without knowing the seeds, it is infeasible to reveal the linkability among these certificates. Thus, not only vehicles can obtain enough certificates for privacy preservation, but also the size of Certificate Revocation List (CRL) remains linear to the number of revoked vehicles, irrelative to the large number of revoked certificates in NEHCM. Furthermore, NEHCM adopts Roadside Units (RSUs) aided certificate service architecture, but the service overhead for an RSU is very low and irrelated to the number of the updated certificates. Extensive simulations demonstrate that the proposed scheme outperforms previously reported works in terms of the revocation cost.