BAT: A Robust Signature Scheme for Vehicular Networks Using Binary Authentication Tree

被引:83
作者
Jiang, Yixin [1 ]
Shi, Minghui [1 ]
Shen, Xuemin [1 ]
Lin, Chuang [2 ]
机构
[1] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
[2] Tsinghua Univ, Beijing 100084, Peoples R China
基金
加拿大自然科学与工程研究理事会;
关键词
Binary authentication tree; identity-based cryptography; robust; signature; vehicular communication; PRIVACY;
D O I
10.1109/T-WC.2008.080280
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we propose a robust and efficient signature scheme for Vehicle-to-Infrastructure communications, called Binary Authentication Tree (BAT). The BAT scheme an effectively eliminate the performance bottleneck when verifying a mass of signatures within a rigorously required interval, even under. adverse scenarios with bogus messages. Given any n received messages with k >= 1 bogus ones, the computation cost to verify all these messages only requires approximately (k + 1) . log(n/k) + 4k - 2 time-consuming pairing operations. The BAT scheme can also be gracefully transplanted to other similar batch signature schemes. In addition, it offers the other conventional security for vehicular networks, such as identity privacy and traceability. Theoretical analysis and simulation results demonstrate the validity and practicality of the BAT scheme.
引用
收藏
页码:1974 / 1983
页数:10
相关论文
共 34 条
[1]  
[Anonymous], P IEEE WCNC
[2]  
[Anonymous], P INT WORKSH VEH AD
[3]  
[Anonymous], P INT WORKSH VEH AD
[4]  
[Anonymous], FED INF PROC STAND P
[5]  
[Anonymous], P 2 INT WORKSH PLAC
[6]  
[Anonymous], DEDICATED SHORT RANG
[7]  
[Anonymous], X9622005 AM NAT STAN
[8]  
[Anonymous], P ACM SIGCOMM AS WOR
[9]  
[Anonymous], P EUR WIR NEXT GEN W
[10]  
[Anonymous], P WMASH 03