Skip to content

A Linear-Complexity RLWE- and PUF-Based Authentication and Key Agreement Scheme for Distributed Drone Networks

Dec 2026 · IEEE Internet of Things Journal · Vol 13, pp. 59488-59501 · 0 citations · 30 references

Abstract

With the expansion of drone network applications, it becomes increasingly important to construct low-complexity identity authentication and session key agreement mechanisms for distributed drone networks under the threat of quantum computing. This article proposes ring learning with error (RLWE)-binary tree-PUF (RBP)-authentication and key agreement (AKA), a lightweight identity AKA protocol consisting of two phases: leaf-level and upper-level aggregation. The protocol integrates the RLWE problem for postquantum security, physical unclonable functions (PUFs) for hardware-bound identity binding, and a binary tree-based hierarchical structure, achieving linear complexity $O(N)$ for AKA while preserving security. Security analysis is performed using the Real-Or-Random (ROR) model and the ProVerif automated verification tool, and performance evaluation is conducted on Raspberry Pi 4B-mounted uncrewed aerial vehicle (UAV) platforms. Experimental and analytical results demonstrate that the major computational and communication overhead of the proposed protocol is concentrated at the leaf level. Nevertheless, the computational cost at the leaf level remains lower than that of the compared distributed schemes and outperforms some centralized schemes. At the upper aggregation level, both computational and communication overhead are significantly reduced, with computational cost lower than all compared schemes and communication cost lower than comparable postquantum schemes. Moreover, due to the linear complexity of the authentication and group key agreement phase, the heavy-load computational overhead, which is dominated by the RLWE-based leaf-level operations, grows linearly with the network size, thereby mitigating the rapid growth of resource consumption in large-scale swarms. The analytical results also show that the proposed scheme exhibits more pronounced computational and communication advantages over the compared distributed schemes as the network scale increases.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.