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 paper proposes RBP-AKA, a lightweight identity authentication and key agreement protocol consisting of two phases: leaf-level and upper-level aggregation. The protocol integrates the Ring Learning With Errors (RLWE) problem for post-quantum security, Physical Unclonable Functions (PUFs) for hardware-bound identity binding, and a binary tree-based hierarchical structure, achieving linear complexityO(N)for authentication and key agreement while preserving security. Security analysis is performed using the Real-Or-Random model and the ProVerif automated verification tool, and performance evaluation is conducted on Raspberry Pi 4B-mounted 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 post-quantum 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.
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 paper proposes RBP-AKA, a lightweight identity authentication and key agreement protocol consisting of two phases: leaf-level and upper-level aggregation. The protocol integrates the Ring Learning With Errors (RLWE) problem for post-quantum security, Physical Unclonable Functions (PUFs) for hardware-bound identity binding, and a binary tree-based hierarchical structure, achieving linear complexityO(N)for authentication and key agreement while preserving security. Security analysis is performed using the Real-Or-Random model and the ProVerif automated verification tool, and performance evaluation is conducted on Raspberry Pi 4B-mounted 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 post-quantum 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.
With the continuous development of quantum computing technology, the traditional public key cryptosystem is facing severe security challenges, especially in the resource-constrained UAV swarm communication scenario. To deal with this problem, this paper proposes a secure communication scheme for the post-quantum era, which combines the Kyber-based group key agreement mechanism and the lightweight identity authentication system constructed by sparse Merkle tree (SMT). The system is initialized by the edge node, and supports the dynamic joining and leaving of the UAV through the authentication and key management mechanism. To meet the security and performance requirements in different application scenarios, we design and integrate two mainstream post-quantum signature schemes to provide flexible identity authentication options. Experimental results show that the scheme has low resource overhead while ensuring security, which is suitable for the actual communication deployment of post-quantum UAV swarm.
With the increasing demand for drones in diverse tasks, the Internet of Drones (IoD) has recently emerged as a significant technology in academia and industry. The IoD environment enables various services, such as traffic and environmental monitoring, disaster situation management, and military operations. However, IoD communication is vulnerable to security threats due to the exchange of sensitive information over insecure public channels. Moreover, public key-based cryptographic schemes are impractical for communication with resource-constrained drones due to their limited computational capability and resource capacity. Therefore, a secure and lightweight key agreement scheme must be developed while considering the characteristics of the IoD environment. In 2024, Alzahrani proposed a secure key agreement protocol for securing the IoD environment. However, Alzahrani’s protocol suffers from high computational overhead due to its reliance on elliptic curve cryptography and is vulnerable to drone and mobile user impersonation attacks and session key disclosure attacks by eavesdropping on public-channel messages. Therefore, this work proposes a lightweight and security-enhanced key agreement scheme for the IoD environment to address the limitations of Alzahrani’s protocol. The proposed protocol employs a physical unclonable function and simple cryptographic operations (XOR and hash functions) to achieve high security and efficiency. This work demonstrates the security of the proposed protocol using informal security analysis. This work also conducted formal security analysis using the Real-or-Random (RoR) model, Burrows–Abadi–Needham (BAN) logic, and Automated Verification of Internet Security Protocols and Applications (AVISPA) simulation to verify the proposed protocol’s session key security, mutual authentication ability, and resistance to replay and MITM attacks, respectively. Furthermore, this work demonstrates that the proposed protocol offers better performance and security by comparing the computational and communication costs and security features with those of relevant protocols.
Secure communication in unmanned aerial vehicle (UAV) networks is critical for a wide range of civil and military applications, from precision agriculture and disaster response to critical infrastructure monitoring. These missions require lightweight, tamper-resistant, and quantum-secure authentication mechanisms. We examine the recently proposed Quantum-Resistant Identity Authentication and Key Agreement Scheme for UAV Networks Based on the Kyber Algorithm (LIGKYX) and demonstrate its critical weaknesses, including a lack of Perfect Forward/Backward Secrecy (PFS/PBS), and desynchronization vulnerabilities. To address these limitations, we propose a novel authentication and key agreement protocol that integrates SRAM-based Physical Unclonable Functions (PUFs) with the Kyber post-quantum key encapsulation mechanism, eliminating the reliance on Elliptic Curve Cryptography (ECC) and stateful counters used in LIGKYX. The security of the proposed protocol is validated through both formal and informal analyses, demonstrating strong resistance to replay, impersonation, man-in-the-middle, desynchronization, and UAV capture attacks. Performance evaluation confirms its efficiency: the total communication overhead is reduced by 7.1% (from 1836 bytes in LIGKYX to 1705 bytes in the proposed scheme), and the total authentication time is reduced by more than 54%, from 87.84 ms in LIGKYX to 40.23 ms in the proposed scheme. These improvements demonstrate that the protocol not only strengthens security but also significantly reduces computation and communication costs. Overall, the proposed solution offers a lightweight, scalable, and quantum-resistant authentication framework tailored for resource-constrained UAV environments, representing a substantial advancement over existing schemes such as LIGKYX.
Abstract The authenticated key agreement (AKA) method used in the Internet of Things (IoT) provides identity authentication and agreed symmetric keys to encrypt large amounts of communication messages for devices and servers. With the development of the quantum computing techniques and corresponding algroithms, classical authenticated key agreement methods based on public key, such as RSA and ECC become vulnerable. Many scholars have proposed lattice-based authenticated key agreement schemes to achieve post-quantum security and address this issue. However, these scheme's security models (such as BR, CK, and ROR) only can capture limited types of adversary attacks and require many communication rounds. To this end, we propose a lower communication rounds lattice-based anonymous authenticated key agreement (LA-AKA) protocol under the seCK model, which can capture a wider range of adversary attacks. The LA-AKA scheme utilizes an identity-based public key system for key agreement, and this system avoids complex resource consumption caused by certificate verification. During the identity authentication and key agreement phase, the communication entities do not need to transmit static public keys; they only need to engage in two communication rounds to generate the session key. Furthermore, the LA-AKA scheme can resist signal leakage attacks caused by key reuse in the ring learning with errors (RLWE) security assumption. The LA-AKA scheme provides higher security, as security analysis proves. The performance evaluation shows that as the number of devices and servers in the system increases, the computational advantage of the LA-AKA scheme in the broadcast channel becomes more significant.
The Internet of Drones (IoD) brings an unprecedented prospect for massive aerial data acquisition; on the other hand, it meets severe hindrances in how to accomplish robust, secure, and economic identity authentication with the limited resources available. In this paper, ChebIoD (Chebyshev polynomial-based mutual authentication and session key generation) is proposed as a new mutual authentication and session key agreement protocol for IoD environments. ChebIoD differs from the existing methods of blockchain, PUF, and ECC in that it consolidates three elaborate mechanisms: (a) post-quantum-oriented design methodology; (b) a dynamic solution for key update/revocation scheme; and (c) formal verification using BAN logic, Real-Or-Random (ROR) model, and AVISPA. The principal difference is that we are able to assign a precise definition of security for key privacy; namely, the protocol achieves both forward and backward secrecy along with performance gains for lightweight polynomial computations without requiring exponential hard assumptions. An Enhanced Security Assessment covers side-channel threats as well as the robustness of the Trusted Authority. We also show an updated performance comparison to the IoD-specific AKE protocols and state-of-the-art schemes in recent works on Blockchain-, Physical Unclonable Function (PUF)-, Elliptic Curve Cryptography (ECC)-, and Chebyshev-based approaches. In identical simulation settings, ChebIoD decreases computation time by up to 63.5%, reduces communication overhead by up to 62.4%, and lowers energy consumption by up to 66.7%, compared to state-of-the-art solutions. These improvements are consistent across multiple baselines, though the exact gains vary depending on the compared protocol. The practical utility is showcased by actual IoD projects for disaster response, precision agriculture, and urban air mobility solutions. Overall, ChebIoD demonstrates efficient and scalable authentication for IoD under simulation.
In recent years, the rapid growth of wireless technologies and the widespread use of mobile devices have drawn people toward diverse web applications. Today, users can conveniently access a variety of online services anytime and anywhere through their mobile devices. With wireless communication becoming the dominant medium, security has emerged as a major challenge, since networks are widely exposed. To address this, numerous authentication protocols have been proposed. However, most existing protocols rely on integer factorization or discrete logarithm problems, which are vulnerable to polynomial-time quantum algorithms. This makes them unsuitable for a post-quantum era. To ensure secure wireless communications for mobile devices, there is a critical need for authenticated key agreement (AKA) protocols that withstand quantum attacks. In this work, we propose a two-party AKA protocol for mobile devices built upon the ring learning with errors (RLWE) problem, whose security is grounded in hard lattice assumptions. We analyze the security of our protocol using formal and informal security methods and assess its performance through comparative evaluation of computational and communication costs against related schemes. Our findings demonstrate that the proposed protocol achieves the necessary security requirements while providing efficient and reliable communication.