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

Advances in intelligent systems and computing

Post-quantum Group Key Agreement Scheme

Julia Bobrysheva, Sergey Vladimirovich Zapechnikov

Published Dec 8, 2020• 3 citations
Publisher
DOI
10.1007/978-3-030-65596-9_7

Related papers

Multi-party post-quantum key exchange schemes

Xuejun Fan, Fei Zhao, Xiu Ping Xu

Journal of Information Security and Applications•Oct 28, 2025•0 citations

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

Quantum Key Agreement

Ri‐Gui Zhou, Xiaoxue Zhang, Lin-Tao Du

Springer eBooks•Jan 1, 2024•0 citations

Group key agreement protocol for heterogeneous cryptographic algorithm IoT devices

Junxiao Yang, Guishan Dong, Dong Liu +2 more

With the explosive growth in the number of IoT devices, the security of group communication has become a critical issue requiring urgent solutions. However, existing group key agreement protocols typically assume that all devices employ the same cryptographic algorithm, making them difficult to adapt to the heterogeneous environment prevalent in actual deployments where traditional cryptography and post-quantum cryptography devices coexist. Therefore, this paper proposes a group key agreement protocol that supports devices with heterogeneous algorithms, such as post-quantum devices (Kyber) and traditional devices (ECDH), to collaboratively perform key agreement within the same group. The protocol is based on the Abdalla compiler, groups devices according to their algorithm type, and introduces group leader nodes that support multiple algorithms simultaneously. The protocol adds only two rounds of interaction compared to the underlying two-party protocol, offering strong compatibility and manageable overhead. Security analysis shows that the security of the protocol can be reduced to the security of the underlying two-party protocols. Performance evaluation results indicate that, compared to existing schemes, this protocol achieves averagely 49% computational and 17.5% communication efficiency in mixed-device scenarios, making it suitable for resource-constrained IoT environments.

IET conference proceedings.•Aug 1, 2026•0 citations

An Overview of Quantum Key Agreement Protocols

Youssouf Achouri, Rima Djellab, Khaled Hamouid

Information systems engineering and management•Jan 1, 2024•0 citations

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

Peilei Xue, Xinghua Li, Zhan Zhang +3 more

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.

IEEE Transactions on Information Forensics and Security•Jan 1, 2026•0 citations
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 explosive growth in the number of IoT devices, the security of group communication has become a critical issue requiring urgent solutions. However, existing group key agreement protocols typically assume that all devices employ the same cryptographic algorithm, making them difficult to adapt to the heterogeneous environment prevalent in actual deployments where traditional cryptography and post-quantum cryptography devices coexist. Therefore, this paper proposes a group key agreement protocol that supports devices with heterogeneous algorithms, such as post-quantum devices (Kyber) and traditional devices (ECDH), to collaboratively perform key agreement within the same group. The protocol is based on the Abdalla compiler, groups devices according to their algorithm type, and introduces group leader nodes that support multiple algorithms simultaneously. The protocol adds only two rounds of interaction compared to the underlying two-party protocol, offering strong compatibility and manageable overhead. Security analysis shows that the security of the protocol can be reduced to the security of the underlying two-party protocols. Performance evaluation results indicate that, compared to existing schemes, this protocol achieves averagely 49% computational and 17.5% communication efficiency in mixed-device scenarios, making it suitable for resource-constrained IoT environments.
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.