Yipin Sun, R. Lu, Xiaodong Lin, Jinshu Su, X. Shen
{"title":"NEHCM:一种新颖高效的基于哈希链的车载通信证书管理方案","authors":"Yipin Sun, R. Lu, Xiaodong Lin, Jinshu Su, X. Shen","doi":"10.4108/CHINACOM.2010.88","DOIUrl":null,"url":null,"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.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"NEHCM: A Novel and Efficient Hash-chain based Certificate Management scheme for vehicular communications\",\"authors\":\"Yipin Sun, R. Lu, Xiaodong Lin, Jinshu Su, X. Shen\",\"doi\":\"10.4108/CHINACOM.2010.88\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":422191,\"journal\":{\"name\":\"2010 5th International ICST Conference on Communications and Networking in China\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 5th International ICST Conference on Communications and Networking in China\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4108/CHINACOM.2010.88\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 5th International ICST Conference on Communications and Networking in China","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/CHINACOM.2010.88","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
NEHCM: A Novel and Efficient Hash-chain based Certificate Management scheme for vehicular communications
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.