Performance of Broadcast Authentication for Secure V2V Safety Applications: A Holistic View

被引:0
作者
Kherani, Arzad A. [1 ]
Iyer, Aravind [1 ]
Varghese, Anitha [1 ]
Shorey, Rajeev [1 ]
机构
[1] Gen Motors India Sci Lab, Bangalore, Karnataka, India
来源
2009 FIRST INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS AND NETWORKS (COMSNETS 2009) | 2009年
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Efficient broadcast authentication has seen a lot of work in the recent past. Most broadcast authentication protocols rely on an underlying Public Key Infrastructure (PKI) to provide a point of trust from which credentials for more efficient cryptographic mechanisms for broadcast authentication can be derived. Thus, there is a logical dependence of some cryptographic credentials (e.g., verifiers for one-time signatures) on others (e.g., certificates from the PKI). However, since V2V messages are transmitted using a random access broadcast, messages containing these credentials could be lost, thereby preventing the verification of credentials depending on the lost ones. Further. since the wireless bandwidth is precious, there have been proposals to optimize the transmission of certificates and other credentials over the air. The more infrequently these are transmitted, the more is the temporal dependence on the verification times of V2V messages. On the flip side, the more frequently these are transmitted, the more is the bandwidth overhead (i.e., greater packet size) and the more the chances of packet collisions over the air. We illustrate this dilemma by means of a case-study, and advocate a holistic approach to broadcast authentication.
引用
收藏
页码:663 / 672
页数:10
相关论文
共 11 条
[1]  
[Anonymous], 2003, E221303 ASTM
[2]  
[Anonymous], SRICSL98 INT COMP SC
[3]  
[Anonymous], 2006, 16092 IEEE
[4]  
[Anonymous], 2002, RSA CryptoBytes
[5]  
Dods C, 2005, LECT NOTES COMPUT SC, V3796, P96
[6]  
IYER A, 2008, COMP COMM WORKSH 200, P1
[7]  
KARGL F, 2008, TOPICS AUTOMOTIVE NE
[8]  
LUK M, 2006, 4 ACM WORKSH SEC AD
[9]  
MERKLE R, 1989, LNCS, V435, P218
[10]  
Perrig A., 2001, ACM CCS 2001, P28