Control Layer Security: Exploiting Unobservable Cooperative States of Autonomous Systems for Secret Key Generation

被引:2
作者
Wei, Zhuangkun [1 ]
Guo, Weisi [1 ,2 ]
机构
[1] Cranfield Univ, Sch Aerosp Transport & Mfg, Bedford MK43 0AL, England
[2] Alan Turing Inst, London NW1 2DB, England
基金
英国工程与自然科学研究理事会;
关键词
Security; Ciphers; Wireless communication; Channel estimation; Trajectory; Task analysis; Quantization (signal); Cybersecurity; cooperative control; secret key generation; wireless communication; autonomous systems; LOCALIZATION; INFORMATION;
D O I
10.1109/TMC.2024.3369754
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The rapid growth of autonomous systems (ASs) with data sharing means new cybersecurity methods have to be developed for them. Existing computational complexity-based cryptography does not have information-theoretical bounds and poses threats to superior computational attackers. This post-quantum cryptography issue indeed motivated the rapid advances in using common physical layer properties to generate symmetrical cipher keys (known as PLS). However, PLS remains sensitive to attackers (e.g., jamming) that destroy its prerequisite wireless channel reciprocity. When ASs are in cooperative tasks (e.g., rescuing searching, and formation flight), they will behave cooperatively in the control layer. Inspired by this, we propose a new security mechanism called control layer security (CLS), which exploits the correlated but unobservable states of cooperative ASs to generate symmetrical cipher keys. This idea is then realized in the linearized UAV cooperative control scenario. The theoretical correlation coefficients between Alice's and Bob's states are computed, based on which common feature selection and key quantization steps are designed. The results from simulation and real UAV experiments show i) an approximately 90% key agreement rate is achieved, and ii) even an Eve with the known observable states and systems fails to estimate the unobservable states and the secret keys relied upon, due to the multiple-to-one mapping from unobservable states (pitch, roll and yaw angles) to the observable states (3D trajectory). This demonstrates CLS as a promising candidate to secure the communications of ASs, especially in the adversarial radio environment with attackers that destroys the prerequisite for current PLS.
引用
收藏
页码:9989 / 10000
页数:12
相关论文
共 44 条
[1]   Post-quantum cryptography [J].
Bernstein, Daniel J. ;
Lange, Tanja .
NATURE, 2017, 549 (7671) :188-194
[2]  
Bishop G., 2001, Proc of SIGGRAPH, Course, V8, P41
[3]  
Brassard G., 1994, Secret-key reconciliation by public discussion, in: Advances in Cryptology-EUROCRYPT'93, P410, DOI 10.1007/3-540-48285-7_35
[4]  
Diffie W., 2022, Democratizing Cryptography: The Work of Whitfield Diffie and Martin Hellman, V42, P365, DOI DOI 10.1145/3549993.3550007
[5]   Particle filtering [J].
Djuric, PM ;
Kotecha, JH ;
Zhang, JQ ;
Huang, YF ;
Ghirmai, T ;
Bugallo, MF ;
Míguez, J .
IEEE SIGNAL PROCESSING MAGAZINE, 2003, 20 (05) :19-38
[6]   Time-Varying Formation Tracking for Second-Order Multi-Agent Systems Subjected to Switching Topologies With Application to Quadrotor Formation Flying [J].
Dong, Xiwang ;
Zhou, Yan ;
Ren, Zhang ;
Zhong, Yisheng .
IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 2017, 64 (06) :5014-5024
[7]   Quantum cryptography [J].
Gisin, N ;
Ribordy, GG ;
Tittel, W ;
Zbinden, H .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :145-195
[8]   Artificial-Noise-Aided Secure MIMO Wireless Communications via Intelligent Reflecting Surface [J].
Hong, Sheng ;
Pan, Cunhua ;
Ren, Hong ;
Wang, Kezhi ;
Nallanathan, Arumugam .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2020, 68 (12) :7851-7866
[9]   Scalable Perception-Action-Communication Loops With Convolutional and Graph Neural Networks [J].
Hu, Ting-Kuei ;
Gama, Fernando ;
Chen, Tianlong ;
Zheng, Wenqing ;
Wang, Zhangyang ;
Ribeiro, Alejandro ;
Sadler, Brian M. .
IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, 2022, 8 :12-24
[10]  
Impagliazzo R., 1989, Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, P12, DOI 10.1145/73007.73009