CPAS: An Efficient Conditional Privacy-Preserving Authentication Scheme for Vehicular Sensor Networks

被引:285
作者
Shim, Kyung-Ah [1 ]
机构
[1] Natl Inst Math Sci, Div Fus & Convergence Math Sci, Taejon 305390, South Korea
关键词
Anonymity; batch verification; bilinear pairing; computational Diffie-Hellman (CDH) problem; digital signature; ID-based system; privacy preservation; traceability; unlinkability; SECURITY;
D O I
10.1109/TVT.2012.2186992
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we propose a conditional privacy-preserving authentication scheme, called CPAS, using pseudo-identity-based signatures for secure vehicle-to-infrastructure communications in vehicular ad hoc networks. The scheme achieves conditional privacy preservation, in which each message launched by a vehicle is mapped to a distinct pseudo-identity, and a trust authority can always retrieve the real identity of a vehicle from any pseudo-identity. In the scheme, a roadside unit (RSU) can simultaneously verify multiple received signatures, thus considerably reducing the total verification time; an RSU can simultaneously verify 2540 signed-messages/s. The time for simultaneously verifying 800 signatures in our scheme can be reduced by 18%, compared with the previous scheme.
引用
收藏
页码:1874 / 1883
页数:10
相关论文
共 30 条
[1]  
Anderson R, 1996, PROCEEDINGS OF THE SECOND USENIX WORKSHOP ON ELECTRONIC COMMERCE, P1
[2]  
[Anonymous], FIPS1801 NAT I STAND
[3]  
[Anonymous], 1997, CRYPTOBYTES TECHNICA
[4]  
[Anonymous], 2009, PROC 6 ANN IEEE COMM
[5]  
[Anonymous], VEH SAF COMM PROJ
[6]  
[Anonymous], LNCS
[7]  
[Anonymous], FIPS1801 NAT I STAND
[8]  
[Anonymous], 2005, INTELLIMOTION
[9]  
[Anonymous], 2006, 16092 IEEE
[10]  
[Anonymous], 2006, SEC WORKSH