Group Authenticated Key Exchange (GAKE) protocol can achieve authentication among multiple users within a group and facilitates the agreement on a consistent group key, which ensures the security of the transmission of data within the group. Society is entering the post-quantum era with the development of quantum computers, and traditional cryptographic algorithms used in existing group authenticated key exchange protocols may not be able to resist quantum attacks. Using the lattice-based key encapsulation mechanism Kyber, we have developed a post-quantum secure group key exchange protocol. The protocol incorporates dynamic joining and leaving phases for group users to ensure scalability, while also utilizing passwords for user authentication. Finally, we formally prove the security of the protocol and compare it with other lattice-based group authenticated key exchange protocols through simulation experiments, the results demonstrate that our protocol is more efficient.
Group Authenticated Key Exchange (GAKE) protocol can achieve authentication among multiple users within a group and facilitates the agreement on a consistent group key, which ensures the security of the transmission of data within the group. Society is entering the post-quantum era with the development of quantum computers, and traditional cryptographic algorithms used in existing group authenticated key exchange protocols may not be able to resist quantum attacks. Using the lattice-based key encapsulation mechanism Kyber, we have developed a post-quantum secure group key exchange protocol. The protocol incorporates dynamic joining and leaving phases for group users to ensure scalability, while also utilizing passwords for user authentication. Finally, we formally prove the security of the protocol and compare it with other lattice-based group authenticated key exchange protocols through simulation experiments, the results demonstrate that our protocol is more efficient.
Group authenticated key exchange protocols (GAKE) are cryptographic tools enabling a group of several users communicating through an insecure channel to securely establish a common shared high-entropy key. In the last years, the need to design cryptographic tools which provide security in the presence of attackers with access to quantum resources has become unquestionable; the field dealing with these types of protocols is usually referred to as Post-Quantum Cryptography. The U.S. National Institute for Standards and Technology (NIST) launched in 2017 an open call to find suitable post-quantum public-key algorithms for standardization. In this work, we design a GAKE that can be instantiated with any key encapsulation mechanism (KEM) that satisfies the strong security notion IND-CCA, matching NIST’s requirements for this primitive. We have implemented our GAKE with the four finalist KEMs from the NIST process: Classic McEliece, Kyber, NTRU, and Saber, making use of the open-source library LibOQS where these algorithms are provided. We have conducted a detailed comparative performance analysis of the resulting GAKE protocols, taking into account all the parameter sets proposed in the submissions. We have also made a performance analysis of all the involved building pieces, including the four finalist KEMs. Finally, we also compare our GAKE with a previous proposal implemented with Kyber.
A three-party authenticated key exchange protocol enables two entities to agree on a session key with the help of a dedicated server through an insecure channel. Lattice based cryptography plays a very important role in authentication and key exchanges that protects against the threat of quantum attacks. However, it is not easy to design quantum resistant password based three-party protocol due to the high demand for security requirements and the limited resources nature of mobile devices. In this article, we have proposed a new post quantum three party key exchange based on a variant of lattice assumption, the ring learning errors. The protocol ensures security against impersonation attack, stolen smartcard attack, password guessing attack, and other existing attacks. In authentication phase, the protocol have used lattice based cryptography that plays a very important role in authentication and key exchanges that protects against the threat of quantum attacks. The proposed protocol ensures both securities against quantum attacks and efficiency due to simple algebraic operations that are polynomial addition and multiplications.
In emerging environments such as cloud computing and the Internet of Things (IoT), secure authentication and key negotiation play a crucial role in protecting data transmitted over public networks. However, many existing authentication protocols are still designed based on classical public-key cryptography primitives, and quantum computing may threaten their security. To address this challenge, we propose a post-quantum authentication and key agreement protocol that uses the lattice-based Kyber key encapsulation mechanism (KEM). Our proposed protocol integrates cryptographic authentication, smart card protection, and post-quantum key encapsulation mechanisms, enabling mutual authentication between users and servers and securely establishing session keys. The security of the protocol is formally analyzed in the Real-or-Random (ROR) model under the random oracle assumption and the IND-CCA security of the underlying KEM scheme. Furthermore, through informal security analysis, we have further demonstrated that the protocol possesses important security properties, including anonymity, untraceability, perfect forward confidentiality, and resistance to known attacks. In addition, the computational cost and communication overhead of the proposed scheme are evaluated and compared with several representative authentication protocols. The results show that the proposed protocol can provide strong security while maintaining low computational cost and communication overhead.
Quantum computing poses a threat on current cryptography methods, prompting initiatives such as the U.S. National Institute for Standards and Technology (NIST) standardization process toward developing post-quantum cryptographic tools. This process concentrates on deploying “key encapsulation mechanisms” and “signature schemes”, mainly focusing on Group Authenticated key exchange (GAKE), which is crucial for secure group communication while ensuring authentication is immune to quantum attacks. Despite various two-party key exchange designs adaptable for group key exchange protocols with multiple parties, experts face challenges in secure group interactions in a post-quantum environment due to the lack of such group protocols solutions. Addressing the necessity of secure group communication in IoTs, we proposed a GAKE protocol. This paper presents its design and implementation secure under QROM; we compared our initial findings on the “Saber-based GAKE” with a Kyber-based GAKE implementation named “Complied Kyber” proposed by Pablos, focusing on IoTs. Our findings show better efficiency than “Compiled Kyber” regarding overall communication duration, especially when involving up to 2000 participants in group communication. Furthermore, thorough investigation and calculations confirm the Saber-GAKE protocol’s interoperability with IoT contexts. The protocol has worthy computational efficiency, with execution speeds of 0.064 ms on ARM Cortex-M4 and 1.56 ms on ARM Cortex-M0 systems. The memory use is well below the allowed limits, with 50.86 KB on Cortex-M4 and 35.84 KB on Cortex-M0. The performance data validate that the Saber-GAKE protocol can effectively and safely function on IoT devices with limited resources, offering strong protection against quantum computing assaults.
A group authenticated key exchange (GAKE) protocol allows a set of parties belonging to a certain designated group to agree upon a common secret key through an insecure communication network. In the last few years, many new cryptographic tools have been specifically designed to thwart attacks from adversaries which may have access to (different kinds of) quantum computation resources. However, few constructions for group key exchange have been put forward. Here, we propose a four-round GAKE which can be proven secure under widely accepted assumptions in the Quantum Random Oracle Model. Specifically, we integrate several primitives from the so-called Kyber suite of post-quantum tools in a (slightly modified) compiler from Abdalla et al. (TCC 2007). More precisely, taking as a starting point an IND-CPA encryption scheme from the Kyber portfolio, we derive, using results from Hövelmanns et al. (PKC 2020), a two-party key exchange protocol and an IND-CCA encryption scheme and prove them fit as building blocks for our compiled construction. The resulting GAKE protocol is secure under the Module-LWE assumption, and furthermore achieves authentication without the use of (expensive) post-quantum signatures.
Post-quantum group key exchange protocols have become an increasingly critical area of research due to the potential threat quantum computers pose to classical cryptographic schemes. Traditional group key exchange protocols, often based on Diffie-Hellman and other number-theoretic assumptions, are vulnerable to quantum attacks. To address this challenge, we propose a novel group key exchange protocol that leverages lattice-based cryptography. Specifically, our approach utilizes lattice trapdoors and a re-encryption mechanism based on the Ring Learning With Errors (RLWE) problem. This design not only achieves post-quantum security but also enhances efficiency and flexibility in dynamic group settings. A common challenge in most protocols is the computational cost of deriving new keys as group members join and leave. Our approach effectively reduces this cost, making key updates more efficient and practical. Our protocol is proven secure under standard lattice assumptions, providing a promising solution for quantum-resistant group key exchange.