An attack-and-defence game for security assessment in vehicular ad hoc networks

被引:0
作者
Suguo Du
Xiaolong Li
Junbo Du
Haojin Zhu
机构
[1] Shanghai Jiao Tong University,
来源
Peer-to-Peer Networking and Applications | 2014年 / 7卷
关键词
Attack tree; Game theory; Vehicular ad hoc networks; Security and privacy;
D O I
暂无
中图分类号
学科分类号
摘要
Recently, there is an increasing interest in Security and Privacy issues in Vehicular ad hoc networks (or VANETs). However, the existing security solutions mainly focus on the preventive solutions while lack a comprehensive security analysis. The existing risk analysis solutions may not work well to evaluate the security threats in vehicular networks since they fail to consider the attack and defense costs and gains, and thus cannot appropriately model the mutual interaction between the attacker and defender. In this study, we consider both of the rational attacker and defender who decide whether to launch an attack or adopt a countermeasure based on its adversary’s strategy to maximize its own attack and defense benefits. To achieve this goal, we firstly adopt the attack-defense tree to model the attacker’s potential attack strategies and the defender’s corresponding countermeasures. To take the attack and defense costs into consideration, we introduce Return On Attack and Return on Investment to represent the potential gain from launching an attack or adopting a countermeasure in vehicular networks. We further investigate the potential strategies of the defender and the attacker by modeling it as an attack-defense game. We then give a detailed analysis on its Nash Equilibrium. The rationality of the proposed game-theoretical model is well illustrated and demonstrated by extensive analysis in a detailed case study.
引用
收藏
页码:215 / 228
页数:13
相关论文
共 24 条
[1]  
Lin X(2008)Security in vehicular Ad Hoc networks IEEE Commun Mag 46 88-95
[2]  
Lu R(2009)Security in service-oriented vehicular networks IEEE Wirel Commun Mag 16 16-22
[3]  
Zhang C(2005)DICTATE: distributed certification authority with probabilistic freshness for Ad Hoc networks IEEE TDSC 2 311-323
[4]  
Zhu H(2006)Suicide for the common good: a new strategy for credential revocation in self-organizing systems ACM SIGOPS Operating Systems Review 40 18-21
[5]  
Ho P-H(2003)Location privacy in pervasive computing Pervasive computing. IEEE 2 46-55
[6]  
Shen X(2007)Strategic games on defense trees FAST 4691 1-15
[7]  
Zhu H(2010)Attack-defense trees and two-player binary zero-sum extensive form games are equivalent GameSec 6442 245-256
[8]  
Lu R(undefined)undefined undefined undefined undefined-undefined
[9]  
Lin X(undefined)undefined undefined undefined undefined-undefined
[10]  
Shen X(undefined)undefined undefined undefined undefined-undefined