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 Access

A Probably Secure Bi-GISIS Based Modified AKE Scheme With Reusable Keys

Sedat Akleylek, Kübra Seyhan

Published Jan 1, 2020• 27 citations
Publisher

Abstract

In this paper, we propose a novel authenticated key exchange scheme based on the Bi-GISIS problem for the post-quantum world. The security of the proposed scheme is based on the hardness assumption of the Bi-GISIS problem. The reusable key property is provided for the proposed scheme in the random oracle model by using the bilateral pasteurization method. To obtain an authenticated key exchange scheme, we use the implicit authentication steps. The security analysis of the proposed scheme is presented in the Bellare-Rogaway security model, where weak perfect forward secrecy is provided. We also give novel perspective to the Bi-GISIS based authenticated key exchange problem.

DOI
10.1109/access.2020.2970537

Related papers

Authenticated Key Exchange from Ideal Lattices.

Jiang Zhang, Zhenfeng Zhang, Jíntai Ding +1 more

Authenticated key exchange (AKE) protocols, such as IKE and SSL/TLS, have been widely used to ensure secure com-munication over the Internet. We present in this paper a practical and provably secure AKE protocol from ideal lat-tices, which is conceptually simple and has similarities to the Diffie-Hellman based protocols such as HMQV (CRYP-TO 2005) and OAKE (CCS 2013). Our protocol does not rely on other cryptographic primitives—in particular, it does not use signatures—simplifying the protocol and resting the security solely on the hardness of the ring learning with er-rors (RLWE) problem. The security is proven in a version of the Bellare-Rogaway model, with enhancements to cap-ture weak Perfect Forward Secrecy. We also present concrete choices of parameters for different security levels. A proof-of-concept implementation shows our protocol is a practical candidate post-quantum key exchange protocol. 1.

•Jan 1, 2014•3 citations

Post-Quantum Anonymous One-Sided Authenticated Key Exchange without Random Oracles

Ren Ishibashi, Kazuki Yoneyama

Authenticated Key Exchange (AKE) is a cryptographic protocol to share a common session key among multiple parties. Usually, PKI-based AKE schemes are designed to guarantee secrecy of the session key and mutual authentication. However, in practice, there are many cases where mutual authentication is undesirable such as in anonymous networks like Tor and Riffle, or difficult to achieve due to the certificate management at the user level such as the Internet. Goldberg et al. formulated a model of anonymous one-sided AKE which guarantees the anonymity of the client by allowing only the client to authenticate the server, and proposed a concrete scheme. However, existing anonymous one-sided AKE schemes are only known to be secure in the random oracle model. In this paper, we propose generic constructions of anonymous one-sided AKE in the random oracle model and in the standard model, respectively. Our constructions allow us to construct the first post-quantum anonymous one-sided AKE scheme from isogenies in the standard model.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Mar 13, 2023•3 citations

Design and Security Analysis of AKE Protocol Based on Self-Certified Public Key

Hongqi Zhang, Binghua Cao

Authenticated key exchange (AKE) not only allows parties to compute the shared key but also ensures authenticity of the parties. A party can compute a shared key only if it is the one it claims to be. In this paper the authors present an AKE protocol based on self-certified public key, which combines Girault's self- certified public key theory and prove its security in the random oracle model. The proposed scheme is proved to be secure assuming the GDH problem is hard.

International Conference on E-Business and Information System Security (EBISS)•May 1, 2009•0 citations

New Authenticated Key Exchange Scheme Based on Ring Learning with Errors Problem

Xiaopeng Yang, Wenping Ma, Chengli Zhang

Using the hard assumption of Ring-Decision Learning With Errors (Ring-DLWE) in the lattice, a new Authenticated Key Exchange (AKE) scheme is proposed, which is based on the Peikert's reconciliation technique. Under the standard model, the proposed scheme is provably secure in the CK model, which is additionally achieves weak Perfect Forward Secrecy (wPFS). Compared with the current Key Exchange (KE) schemes based on the LWE, the proposed scheme not only protects the shared session key with balanced key derivation function but also resists quantum attacks because of the hard assumption on lattice problem.

•Jan 1, 2015•1 citation

A Quantum Secure and Efficient RLWE-Based Authenticated Key Exchange Protocol for Mobile Devices

Gaurav Mittal, Saibal Kumar Pal, Dharminder Dharminder

The Ring Learning with Errors (RLWE) problem has emerged as a foundational hardness assumption for post-quantum authenticated key exchange (AKE) protocols. In this paper, we propose a post-quantum and efficient RLWE-Based AKE protocol for mobile devices. We provide formal security reduction in the random oracle model under the decisional RLWE and PRF assumptions. We also show that our scheme is safe against key mismatch attack, signal leakage attack, and provide informal analysis of all standard AKE security properties. Further, we showcase that our scheme also provides perfect forward secrecy and replay attack resistance. Finally, we compare our scheme with several other existing schemes in terms of various security attributes along with computational efficiency to demonstrate its practicality and advantages over the other schemes.

International Journal of Foundations of Computer Science•Oct 17, 2026•0 citations

Big Data-based Authenticated Key Exchange Resilient to Ephemeral Key Leakage without Random Oracles

Ren Ishibashi, Kazuki Yoneyama

Authenticated Key Exchange (AKE) is a cryptographic protocol to share a common session key among multiple parties. At ISC 2021, Liu, Tang, and Zhou proposed a modular multi-factor AKE framework resilient to a characteristic attack called server compromise impersonation based on big data in the bounded-retrieval model and concrete post-quantum big data-based AKE schemes. They also formulated a security model (LTZ model) that captures perfect forward secrecy, key compromise impersonation, and server compromise impersonation. However, the LTZ model does not consider the compromise of ephemeral secret keys, and their schemes rely on the random oracle model. In this paper, we extend the LTZ model (LTZ-eCK model) to capture the compromise of ephemeral secret keys and propose a generic construction of big data-based AKE resilient to both server compromise impersonation and ephemeral key leakage in the standard model. Our generic construction allows us to achieve the post-quantum big data-based AKE scheme (from isogenies, lattice, etc.) in the LTZ-eCK model without random oracles.

Journal of Information Processing•Jan 1, 2024•0 citations
In this paper, we propose a novel authenticated key exchange scheme based on the Bi-GISIS problem for the post-quantum world. The security of the proposed scheme is based on the hardness assumption of the Bi-GISIS problem. The reusable key property is provided for the proposed scheme in the random oracle model by using the bilateral pasteurization method. To obtain an authenticated key exchange scheme, we use the implicit authentication steps. The security analysis of the proposed scheme is presented in the Bellare-Rogaway security model, where weak perfect forward secrecy is provided. We also give novel perspective to the Bi-GISIS based authenticated key exchange problem.
Authenticated key exchange (AKE) protocols, such as IKE and SSL/TLS, have been widely used to ensure secure com-munication over the Internet. We present in this paper a practical and provably secure AKE protocol from ideal lat-tices, which is conceptually simple and has similarities to the Diffie-Hellman based protocols such as HMQV (CRYP-TO 2005) and OAKE (CCS 2013). Our protocol does not rely on other cryptographic primitives—in particular, it does not use signatures—simplifying the protocol and resting the security solely on the hardness of the ring learning with er-rors (RLWE) problem. The security is proven in a version of the Bellare-Rogaway model, with enhancements to cap-ture weak Perfect Forward Secrecy. We also present concrete choices of parameters for different security levels. A proof-of-concept implementation shows our protocol is a practical candidate post-quantum key exchange protocol. 1.
Authenticated Key Exchange (AKE) is a cryptographic protocol to share a common session key among multiple parties. Usually, PKI-based AKE schemes are designed to guarantee secrecy of the session key and mutual authentication. However, in practice, there are many cases where mutual authentication is undesirable such as in anonymous networks like Tor and Riffle, or difficult to achieve due to the certificate management at the user level such as the Internet. Goldberg et al. formulated a model of anonymous one-sided AKE which guarantees the anonymity of the client by allowing only the client to authenticate the server, and proposed a concrete scheme. However, existing anonymous one-sided AKE schemes are only known to be secure in the random oracle model. In this paper, we propose generic constructions of anonymous one-sided AKE in the random oracle model and in the standard model, respectively. Our constructions allow us to construct the first post-quantum anonymous one-sided AKE scheme from isogenies in the standard model.
Using the hard assumption of Ring-Decision Learning With Errors (Ring-DLWE) in the lattice, a new Authenticated Key Exchange (AKE) scheme is proposed, which is based on the Peikert's reconciliation technique. Under the standard model, the proposed scheme is provably secure in the CK model, which is additionally achieves weak Perfect Forward Secrecy (wPFS). Compared with the current Key Exchange (KE) schemes based on the LWE, the proposed scheme not only protects the shared session key with balanced key derivation function but also resists quantum attacks because of the hard assumption on lattice problem.
The Ring Learning with Errors (RLWE) problem has emerged as a foundational hardness assumption for post-quantum authenticated key exchange (AKE) protocols. In this paper, we propose a post-quantum and efficient RLWE-Based AKE protocol for mobile devices. We provide formal security reduction in the random oracle model under the decisional RLWE and PRF assumptions. We also show that our scheme is safe against key mismatch attack, signal leakage attack, and provide informal analysis of all standard AKE security properties. Further, we showcase that our scheme also provides perfect forward secrecy and replay attack resistance. Finally, we compare our scheme with several other existing schemes in terms of various security attributes along with computational efficiency to demonstrate its practicality and advantages over the other schemes.
Authenticated Key Exchange (AKE) is a cryptographic protocol to share a common session key among multiple parties. At ISC 2021, Liu, Tang, and Zhou proposed a modular multi-factor AKE framework resilient to a characteristic attack called server compromise impersonation based on big data in the bounded-retrieval model and concrete post-quantum big data-based AKE schemes. They also formulated a security model (LTZ model) that captures perfect forward secrecy, key compromise impersonation, and server compromise impersonation. However, the LTZ model does not consider the compromise of ephemeral secret keys, and their schemes rely on the random oracle model. In this paper, we extend the LTZ model (LTZ-eCK model) to capture the compromise of ephemeral secret keys and propose a generic construction of big data-based AKE resilient to both server compromise impersonation and ephemeral key leakage in the standard model. Our generic construction allows us to achieve the post-quantum big data-based AKE scheme (from isogenies, lattice, etc.) in the LTZ-eCK model without random oracles.