Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Information Forensics and Security

Cross-Epoch Key Verification with Zero Knowledge for Asynchronous Group Key Agreement in UAV Swarm

Peilei Xue, Xinghua Li, Zhan Zhang, Zhe Ren, Junwei Zhang, Robert Huijie Deng

Published Jan 1, 2026• 0 citations
Publisher

Abstract

UAV swarm is characterized by intermittent connectivity and frequent membership changes, which substantially complicate the design of secure group communication mechanisms. Asynchronous group key agreement (AGKA) allows members to update keys asynchronously, but achieving post-compromise secrecy requires heavy coordination. Moreover, using zero-knowledge proofs to verify key updates according to the prescribed rules can incur significantly high verification overhead. To address this, we propose a post-quantum cross-epoch key verification framework for a UAV swarm. We design an RLWE-based folding UPKE scheme that combines a left proof tree with a folding accumulator, allowing a returning UAV to verify cross-epoch key update using only a logarithmic-size proof path. We further develop a ZKLaBoo protocol that uses (k,n+1)-decomposition for the RLWE-based circuit, enabling zero-knowledge verification of both single-epoch update and cross-epoch chase without revealing update token materials. Our approaches reduce encryption and decryption times and verification time, and are well-suited to a UAV swarm under AGKA.

DOI
10.1109/tifs.2026.3751588

Related papers

A Post-Quantum Authentication and Key Agreement Scheme for Drone Swarms

Linlin He, Meng Zhao, Xu An Wang +3 more

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.

Electronics•Aug 25, 2025•10 citations

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

Tao Xia, Jun He, Jin Ping Cao +2 more

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.

IEEE Internet of Things Journal•Jan 1, 2026•0 citations

WiP: Lightweight Command-Origin Authentication for Future-Safe UAV Swarms

Chandranshu Gupta, Nitish Bhardwaj, Bishwas Wagle +4 more

Unmanned Aerial Vehicle (UAV) swarms are increasingly used in surveillance, sensing, and mission-critical coordination. Their wider deployment introduces security challenges when UAVs must authenticate control decisions without continuous Ground Control Station (GCS) support, especially against quantum-capable adversaries. Existing protocols mainly address UAV-GCS authentication or group key establishment, but they do not directly bind each accepted runtime command to the mission-approved leader. To address this gap, we propose a hash-based command authentication protocol for mission-bounded UAV swarms. It combines Merkle-tree accumulators with FORS-based one-time command tokens to bind leader authority to the enrolled mission state, enabling followers to verify commands locally without online GCS support. Security analysis and Raspberry Pi 5 measurements show 253.9 μs follower-side verification latency, lower than the evaluated post-quantum alternatives.

ACM Annual International Conference on Mobile Computing and Networking (MobiCom)•Oct 21, 2026•0 citations

Design, Formal Verification, and Evaluation of a Post-Quantum EDHOC Variant for UAV Communications

Rodrigo Duarte de Meneses, Caio Teixeira, Marco Amaral Henriques

Unmanned Aerial Vehicle (UAV) swarms require secure and efficient protocols for communication in dynamic and adversarial environments. This paper presents a post-quantum authenticated key exchange protocol for UAV communications, inspired by recent post-quantum extensions of EDHOC. The protocol is modeled in SAPIC+ and verified in the Tamarin Prover under a Dolev–Yao adversary, establishing executability, mutual authentication, key secrecy, and forward secrecy properties. Communication overhead and handshake latency are estimated using standardized parameter sizes and benchmark data for ARM Cortex-M4 and x86 platforms, showing how the choice of post-quantum primitives affects the feasibility of authenticated key exchange in constrained UAV deployments.

Simpósio Brasileiro de Cibersegurança (SBSeg)•Sep 1, 2026•0 citations

Group Secret Key Generation Using Physical Layer Security for UAV Swarm Communications

Sobia Jangsher, Arafat Al‐Dweik, Youssef Iraqi +2 more

In unmanned aerial vehicle (UAV) swarm networks, a group secret key (GSK) is required to enable secured UAV-UAV communications, multicast, and broadcast transmission. Moreover, it can be used for device authentication. Therefore, this paper proposes an efficient GSK protocol denoted as the sequential secret group key (SSGK) algorithm for distributed UAV swarmsecured communications. The proposed protocol utilizes network coding to generate cooperation information that is transmitted on the channel and is uncorrelated with the generated secret key. The proposed protocol depends on the pairwise key generation (PKG) process between pairs of UAVs. However, not all possible pairwise agreements are performed to minimize the time and signaling overhead, i.e., the pairwise key agreement is performed only between selected UAVs as a compromise between the required overhead transmission resources and the achieved redundancy level. The obtained results show that a redundancy level of 4 is sufficient to provide a reliable GSK generation process. The results also show that the performance of the key generation process highly depends on the channelbit error rate (BER), the number of UAVs, and the key length.

IEEE Transactions on Aerospace and Electronic Systems•Aug 22, 2023•26 citations

POSTER: Post-Quantum UAV-UAV Authentication with PUF-Rooted LMS

Chandranshu Gupta, Nitish Bhardwaj, Gaurav Varshney

UAV swarms increasingly rely on direct peer communication for coordinated operation. Existing post-quantum mutual-authentication solutions often incur substantial system overhead, expose persistent credentials to physical capture, or depend on online ground, edge, or blockchain infrastructure. To address these limitations, we present a post-quantum authenticated key-establishment protocol integrating an APUF-based key-reconstruction module with LM-OTS/LMS, ML-KEM-512, and transcript-bound HMAC confirmation. The reconstructed device root derives version-specific LMS signing material, while standardized LM-OTS/LMS signatures authenticate fresh ML-KEM material and session context. The protocol supports repository-assisted and signer-carried LMS paths, trading direct-link communication for runtime infrastructure availability. Security is evaluated symbolically using Verifpal and through informal attack analysis. A prototype on two ESP32-WROOM-DA endpoints with a Pynq-Z2-based 64-stage APUF and Python fuzzy extractor demonstrates practical hardware-rooted post-quantum authentication on constrained UAV platforms.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Nov 12, 2026•0 citations
UAV swarm is characterized by intermittent connectivity and frequent membership changes, which substantially complicate the design of secure group communication mechanisms. Asynchronous group key agreement (AGKA) allows members to update keys asynchronously, but achieving post-compromise secrecy requires heavy coordination. Moreover, using zero-knowledge proofs to verify key updates according to the prescribed rules can incur significantly high verification overhead. To address this, we propose a post-quantum cross-epoch key verification framework for a UAV swarm. We design an RLWE-based folding UPKE scheme that combines a left proof tree with a folding accumulator, allowing a returning UAV to verify cross-epoch key update using only a logarithmic-size proof path. We further develop a ZKLaBoo protocol that uses (k,n+1)-decomposition for the RLWE-based circuit, enabling zero-knowledge verification of both single-epoch update and cross-epoch chase without revealing update token materials. Our approaches reduce encryption and decryption times and verification time, and are well-suited to a UAV swarm under AGKA.
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 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.
Unmanned Aerial Vehicle (UAV) swarms are increasingly used in surveillance, sensing, and mission-critical coordination. Their wider deployment introduces security challenges when UAVs must authenticate control decisions without continuous Ground Control Station (GCS) support, especially against quantum-capable adversaries. Existing protocols mainly address UAV-GCS authentication or group key establishment, but they do not directly bind each accepted runtime command to the mission-approved leader. To address this gap, we propose a hash-based command authentication protocol for mission-bounded UAV swarms. It combines Merkle-tree accumulators with FORS-based one-time command tokens to bind leader authority to the enrolled mission state, enabling followers to verify commands locally without online GCS support. Security analysis and Raspberry Pi 5 measurements show 253.9 μs follower-side verification latency, lower than the evaluated post-quantum alternatives.
Unmanned Aerial Vehicle (UAV) swarms require secure and efficient protocols for communication in dynamic and adversarial environments. This paper presents a post-quantum authenticated key exchange protocol for UAV communications, inspired by recent post-quantum extensions of EDHOC. The protocol is modeled in SAPIC+ and verified in the Tamarin Prover under a Dolev–Yao adversary, establishing executability, mutual authentication, key secrecy, and forward secrecy properties. Communication overhead and handshake latency are estimated using standardized parameter sizes and benchmark data for ARM Cortex-M4 and x86 platforms, showing how the choice of post-quantum primitives affects the feasibility of authenticated key exchange in constrained UAV deployments.
In unmanned aerial vehicle (UAV) swarm networks, a group secret key (GSK) is required to enable secured UAV-UAV communications, multicast, and broadcast transmission. Moreover, it can be used for device authentication. Therefore, this paper proposes an efficient GSK protocol denoted as the sequential secret group key (SSGK) algorithm for distributed UAV swarmsecured communications. The proposed protocol utilizes network coding to generate cooperation information that is transmitted on the channel and is uncorrelated with the generated secret key. The proposed protocol depends on the pairwise key generation (PKG) process between pairs of UAVs. However, not all possible pairwise agreements are performed to minimize the time and signaling overhead, i.e., the pairwise key agreement is performed only between selected UAVs as a compromise between the required overhead transmission resources and the achieved redundancy level. The obtained results show that a redundancy level of 4 is sufficient to provide a reliable GSK generation process. The results also show that the performance of the key generation process highly depends on the channelbit error rate (BER), the number of UAVs, and the key length.
UAV swarms increasingly rely on direct peer communication for coordinated operation. Existing post-quantum mutual-authentication solutions often incur substantial system overhead, expose persistent credentials to physical capture, or depend on online ground, edge, or blockchain infrastructure. To address these limitations, we present a post-quantum authenticated key-establishment protocol integrating an APUF-based key-reconstruction module with LM-OTS/LMS, ML-KEM-512, and transcript-bound HMAC confirmation. The reconstructed device root derives version-specific LMS signing material, while standardized LM-OTS/LMS signatures authenticate fresh ML-KEM material and session context. The protocol supports repository-assisted and signer-carried LMS paths, trading direct-link communication for runtime infrastructure availability. Security is evaluated symbolically using Verifpal and through informal attack analysis. A prototype on two ESP32-WROOM-DA endpoints with a Pynq-Z2-based 64-stage APUF and Python fuzzy extractor demonstrates practical hardware-rooted post-quantum authentication on constrained UAV platforms.