Journal of Computer Science and Technology ›› 2020, Vol. 35 ›› Issue (4): 825-842.doi: 10.1007/s11390-020-0260-5

Special Issue: Computer Networks and Distributed Computing

• Computer Networks and Distributed Computing • Previous Articles     Next Articles

A Multi-Point Distance-Bounding Protocol for Securing Automatic Dependent Surveillance-Broadcast in Unmanned Aerial Vehicle Applications

Zachary P. Languell, Qijun Gu*, Member, IEEE        

  1. Department of Computer Science, Texas State University, San Marcos, TX 78666, USA
  • Received:2019-12-31 Revised:2020-05-29 Online:2020-07-20 Published:2020-07-20
  • Contact: Qijun Gu E-mail:qijun@txstate.edu
  • About author:Zachary P. Languell received his Bachelor's and Master's degrees in computer science from Texas State University, San Marcos, in 2016 and 2019 respectively. He is currently working as a software security engineer for Relativity, an e-discovery software solutions company, specializing in cloud and SaaS security.

The Automatic Dependent Surveillance-Broadcast (ADS-B) protocol is being adopted for use in unmanned aerial vehicles (UAVs) as the primary source of information for emerging multi-UAV collision avoidance algorithms. The lack of security features in ADS-B leaves any processes dependent upon the information vulnerable to a variety of threats from compromised and dishonest UAVs. This could result in substantial losses or damage to properties. This research proposes a new distance-bounding scheme for verifying the distance and flight trajectory in the ADS-B broadcast data from surrounding UAVs. The proposed scheme enables UAVs or ground stations to identify fraudulent UAVs and avoid collisions. The scheme was implemented and tested in the ArduPilot SITL (Software In The Loop) simulator to verify its ability to detect fraudulent UAVs. The experiments showed that the scheme achieved the desired accuracy in both flight trajectory measurement and attack detection.

Key words: automatic dependent surveillance-broadcast (ADS-B); unmanned aerial vehicle (UAV); distance bounding; collision; airspace safety;

[1] Stark B, Stevenson B, Chen Y. ADS-B for small unmanned aerial systems:Case study and regulatory practices. In Proc. the 2013 International Conference on Unmanned Aircraft Systems, May 2013, pp.152-159.
[2] Sesso D B, Vismari L F, Camargo J B. An approach to assess the safety of ADS-B based unmanned aerial systems. In Proc. the 2014 International Conference on Unmanned Aircraft Systems, May 2014, pp.669-676.
[3] Lin Y, Saripalli S. Sense and avoid for unmanned aerial vehicles using ADS-B. In Proc. the IEEE International Conference on Robotics and Automation, May 2015, pp.6402-6407.
[4] Costin A, Francillon A. Ghost in the Air (Traffic):On insecurity of ADS-B protocol and practical attacks on ADS-B devices. In Proc. the 2012 Black Hat USA, July 2012.
[5] Strohmeier M, Lenders V, Martinovic I. On the security of the automatic dependent surveillance-broadcast protocol. IEEE Communications Surveys Tutorials, 2015, 17(2):1066-1087.
[6] Manesh M R, Kaabouch N. Analysis of vulnerabilities, attacks, countermeasures and overall risk of the automatic dependent surveillance-broadcast (ADS-B) system. International Journal of Critical Infrastructure Protection, 2017, 19:16-31.
[7] Manesh M R, Mullins M, Foerster K, Kaabouch N. A preliminary effort toward investigating the impacts of ADS-B message injection attack. In Proc. the 2018 IEEE Aerospace Conference, March 2018.
[8] Yang H M, Zhou Q X. Yao M X, Lu R X, Li H W, Zhang X S. A practical and compatible cryptographic solution to ADS-B security. IEEE Internet of Things Journal, 2019, 6(2):3322-3334.
[9] Yum D H, Kim J S, Hong S J, Lee P J. Distance bounding protocol with adjustable false acceptance rate. IEEE Communications Letters, 2011, 15(4):434-436.
[10] Languell Z P, Gu Q. Securing ADS-B with multi-point distance-bounding for UAV collision avoidance. In Proc. the 16th IEEE International Conference on Mobile Ad Hoc and Smart Systems, November 2019, pp.145-153.
[11] Abu-Mahfouz A, Hancke G P. Distance bounding:A practical security solution for real-time location systems. IEEE Transactions on Industrial Informatics, 2013, 9(1):16-27.
[12] Munilla J, Peinado A. Distance bounding protocols for RFID enhanced by using void-challenges and analysis in noisy channels. Wirel. Commun. Mob. Comput., 2008, 8(9):1227-1232.
[13] Lee S, Kim J S, Hong S J, Kim J. Distance bounding with delayed responses. IEEE Communications Letters, 2012, 16(9):1478-1481.
[14] Entezari R, Bahramgiri H, Tajamolian M. A Mafia and distance fraud high-resistance RFID distance bounding protocol. In Proc. the 11th International Conference on Information Security and Cryptology, September 2014, pp.67-72.
[15] Mitrokotsa A, Dimitrakakis C, Peris-Lopez P, HernandezCastro J C. Reid et al.'s distance bounding protocol and mafia fraud attacks over noisy channels. IEEE Communications Letters, 2010, 14(2):121-123.
[16] Hancke G P. Distance-bounding for RFID:Effectiveness of ‘terrorist fraud’ in the presence of bit errors. In Proc. the 2012 IEEE International Conference on RFIDTechnologies and Applications, November 2012, pp.91-96.
[17] Cremers C, Rasmussen K B, Schmidt B, Capkun S. Distance hijacking attacks on distance bounding protocols. In Proc. the IEEE Symposium on Security and Privacy, May 2012, pp.113-127.
[18] Kim Y S, Kim S H. RFID distance bounding protocol using m-ary challenges. In Proc. the 2011 International Conference on ICT Convergence, September 2011, pp.782-783.
[19] Schäfer M, Lenders V, Martinovic I. Experimental analysis of attacks on next generation air traffic communication. In Proc. the 11th International Conference Appl. Cryptography Netw. Security, June 2013, pp.253-271.
[20] Hancke G P, Kuhn M G. An RFID distance bounding protocol. In Proc. the 1st International Conference on Security and Privacy for Emerging Areas in Communications Networks, September 2005, pp.67-73.
[21] Bussard L, Bagga W. Distance-bounding proof of knowledge to avoid real-time attacks. In Proc. the 20th International Conference on Information Security, May 2005, pp.223-238.
[22] Gu Q, Michanowicz D, Jia C. Developing a modular unmanned aerial vehicle (UAV) platform for air pollution profiling. Sensors, 2018, 18(12):Article No. 4363.
[23] Rasmussen K B, Capkun S. Realization of RF distance bounding. In Proc. the 19th USENIX Conference on Security, August 2010, pp.389-402.
[1] Nour El Houda Bahloul, Saadi Boudjit, Marwen Abdennebi, Djallel Eddine Boubiche. A Flocking-Based on Demand Routing Protocol for Unmanned Aerial Vehicles [J]. , 2018, 33(2): 263-276.
[2] Peng Du, Jie-Yi Zhao, Wan-Bin Pan, Yi-Gang Wang. GPU Accelerated Real-time Collision Handling in Virtual Disassembly [J]. , 2015, 30(3): 511-518.
[3] Gao-Li Wang. Collision Attack on the Full Extended MD4 and Pseudo-Preimage Attack on RIPEMD [J]. , 2013, 28(1): 129-143.
[4] Jie Liang and Xue-Jia Lai. Improved Collision Attack on Hash Function MD5 [J]. , 2007, 22(1): 79-87 .
[5] Yang Liu and Fa-Lai Chen. Algebraic Conditions for Classifying the Positional Relationships Between Two Conics and Their Applications [J]. , 2004, 19(5): 0-0.
[6] HE Taosong;. Volumetric Virtual Environments [J]. , 2000, 15(1): 37-46.
[7] Li Wei; Zhang Bo; Hilmar Jaschek;. Real-Time Collision-Free Path Planning for Robots in Configuration Space [J]. , 1994, 9(1): 37-52.
[8] Yan Yong;. An Optimal Algorithm for Solving Collision Distance Between Convex Polygons in Plane [J]. , 1993, 8(4): 81-87.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] Zhou Di;. A Recovery Technique for Distributed Communicating Process Systems[J]. , 1986, 1(2): 34 -43 .
[2] Li Wanxue;. Almost Optimal Dynamic 2-3 Trees[J]. , 1986, 1(2): 60 -71 .
[3] Wang Xuan; Lü Zhimin; Tang Yuhai; Xiang Yang;. A High Resolution Chinese Character Generator[J]. , 1986, 1(2): 1 -14 .
[4] C.Y.Chung; H.R.Hwa;. A Chinese Information Processing System[J]. , 1986, 1(2): 15 -24 .
[5] Chen Shihua;. On the Structure of (Weak) Inverses of an (Weakly) Invertible Finite Automaton[J]. , 1986, 1(3): 92 -100 .
[6] Jin Lan; Yang Yuanyuan;. A Modified Version of Chordal Ring[J]. , 1986, 1(3): 15 -32 .
[7] Pan Qijing;. A Routing Algorithm with Candidate Shortest Path[J]. , 1986, 1(3): 33 -52 .
[8] Zhang Cui; Zhao Qinping; Xu Jiafu;. Kernel Language KLND[J]. , 1986, 1(3): 65 -79 .
[9] Huang Heyan;. A Parallel Implementation Model of HPARLOG[J]. , 1986, 1(4): 27 -38 .
[10] Shen Li; Stephen Y.H.Su;. Generalized Parallel Signature Analyzers with External Exclusive-OR Gates[J]. , 1986, 1(4): 49 -61 .

ISSN 1000-9000(Print)

         1860-4749(Online)
CN 11-2296/TP

Home
Editorial Board
Author Guidelines
Subscription
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
Tel.:86-10-62610746
E-mail: jcst@ict.ac.cn
 
  Copyright ©2015 JCST, All Rights Reserved