Name
Abstract | ||
|---|---|---|
Controller Area Network (CAN) is the most widely employed real-time communication protocol for safety-critical applications. Recently, an issue of security countermeasure for CAN is the limited bandwidth of CAN. For this reason, the ID hopping technology has been proposed to improve the security with limited resource by varying the ID of a message when transmitting it on the CAN bus. However, the existing ID hopping method is not effective in terms of ID variation. In this paper, we propose a real-time and security mechanism to improve the security effect of ID hopping. Firstly, we obfuscate the priority of messages with two MILP models and a greedy algorithm called "Priority Bound Decision Algorithm", making priority different on the application layer. Secondly, combining the ID-hopping, our method can enhance the diversity of IDs on the data link layer. Thirdly, the results of security analysis indicate that our proposal can hinder the targeted DoS, replay attack and reverse engineering better than some existing methods. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/DASC/PiCom/DataCom/CyberSciTec.2018.00029 | 2018 IEEE 16th Intl Conf on Dependable, Autonomic and Secure Computing, 16th Intl Conf on Pervasive Intelligence and Computing, 4th Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech) |
Keywords | Field | DocType |
Vehicle Security,ID hopping,DoS,CAN,Priority assignment,Real-Time | CAN bus,Application layer,Computer science,Data link layer,Computer network,Greedy algorithm,Security analysis,Obfuscation,Replay attack,Communications protocol | Conference |
ISBN | Citations | PageRank |
978-1-5386-7519-9 | 0 | 0.34 |
References | Authors | |
6 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shan Ding | 1 | 17 | 3.81 |
| Tong Zhao | 2 | 14 | 7.30 |
| Ryo Kurachi | 3 | 39 | 9.69 |
| Gang Zeng | 4 | 949 | 70.21 |