Journal of Information Processing

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

Ren Ishibashi, Kazuki Yoneyama

Published Jan 1, 2024• 0 citations

Abstract

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.

DOI: 10.2197/ipsjjip.32.690

Related papers

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 SciencesMar 13, 20231 citation

An RSA-Based Leakage-Resilient Authenticated Key Exchange Protocol Secure against Replacement Attacks, and Its Extensions

SeongHan Shin, Kazukuni Kobara, Hideki Imai

Secure channels can be realized by an authenticated key exchange (AKE) protocol that generates authenticated session keys between the involving parties. In [32], Shin et al., proposed a new kind of AKE (RSA-AKE) protocol whose goal is to provide high efficiency and security against leakage of stored secrets as much as possible. Let us consider more powerful attacks where an adversary completely controls the communications and the stored secrets (the latter is denoted by “replacement” attacks). In this paper, we first show that the RSA-AKE protocol [32] is no longer secure against such an adversary. The main contributions of this paper are as follows: (1) we propose an RSA-based leakage-resilient AKE (RSA-AKE2) protocol that is secure against active attacks as well as replacement attacks; (2) we prove that the RSA-AKE2 protocol is secure against replacement attacks based on the number theory results; (3) we show that it is provably secure in the random oracle model, by showing the reduction to the RSA one-wayness, under an extended model that covers active attacks and replacement attacks; (4) in terms of efficiency, the RSA-AKE2 protocol is comparable to [32] in the sense that the client needs to compute only one modular multiplication with pre-computation; and (5) we also discuss about extensions of the RSA-AKE2 protocol for several security properties (i.e., synchronization of stored secrets, privacy of client and solution to server compromise-impersonation attacks).

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesJan 1, 20106 citations

Modular Framework for Constructing IoT-Server AKE in Post-Quantum Setting

Bowen Liu, Qiang Tang, Jianying Zhou

Authenticated key exchange (AKE) allows two parties to authenticate each other and establish a secret session key to build a secure channel, and it has been well studied in the literature. With the approaching of quantum computers, designing post-quantum secure AKE schemes becomes an urgent task. Today, several KE schemes have been proposed while only a small number of AKE schemes exist. Very few of them have considered resource-constrained participants like IoT devices. In this paper, assuming a typical client-server setting where the client is an IoT device, we propose a modular framework that converts any post-quantum secure KE scheme into a post-quantum secure AKE scheme. Equipped with two authentication factors, the resulted AKE scheme provides a number of security guarantees including Perfect forward secrecy (PFS), Key compromise impersonation (KCI) resilience and Server compromise impersonation (SCI) resilience. We further instantiate the framework by selecting the most efficient KE scheme, namely NewHope Compact, and implement the scheme with some optimisation techniques and conduct relevant analysis and comparisons. In a nutshell, the computational time of the server side is 1.11 ms on a PC and 6.22 ms of the IoT device simulated on Raspberry Pi 3B+, and it seems to be efficient enough for most IoT application scenarios.

IEEE AccessJan 1, 20225 citations

Strong Authenticated Key Exchange with Auxiliary Inputs.

Rongmao Chen, Yi Mu, Guomin Yang +2 more

Leakage attacks, including various kinds of side-channel attacks, allow an attacker to learn partial information about the internal secrets such as the secret key and the randomness of a cryptographic system. Designing a strong, meaningful, yet achievable security notion to capture practical leakage attacks is one of the primary goals of leakage-resilient cryptography. In this work, we revisit the modelling and design of authenticated key exchange (AKE) protocols with leakage resilience. We show that the prior works on this topic are inadequate in capturing realistic leakage attacks. To close this research gap, we propose a new security notion named leakage-resilient eCK model w.r.t. auxiliary inputs (AI-LR-eCK) for AKE protocols, which addresses the limitations of the previous models. Our model allows computationally hard-to-invert leakage of both the long-term secret key and the randomness, and also addresses a limitation existing in most of the previous models where the adversary is disallowed to make leakage queries during the challenge session. As another major contribution of this work, we present a generic framework for the construction of AKE protocols that are secure under the proposed AI-LR-eCK model. An instantiation based on the decision Diffie–Hellman (DDH) assumption in the standard model is also given to demonstrate the feasibility of our proposed framework.

Jan 1, 20170 citations

Adaptive-ID Secure Hierarchical ID-Based Authenticated Key Exchange under Standard Assumptions without Random Oracles

Ren Ishibashi, Kazuki Yoneyama

Hierarchical ID-based authenticated key exchange (HID-AKE) is a cryptographic protocol to establish a common session key between parties with authentication based on their IDs with the hierarchical delegation of key generation functionality. All existing HID-AKE schemes are selective ID secure, and the only known standard model scheme relies on a non-standard assumption such as the q-type assumption. In this paper, we propose a generic construction of HID-AKE that is adaptive ID secure in the HID-eCK model (maximal-exposure-resilient security model) without random oracles. One of the concrete instantiations of our generic construction achieves the first adaptive ID secure HID-AKE scheme under the (standard) k-lin assumption in the standard model. Furthermore, it has the advantage that the computational complexity of pairing and exponentiation operations and the communication complexity do not depend on the depth of the hierarchy. Also, the other concrete instantiation achieves the first HID-AKE scheme based on lattices (i.e., post-quantum).

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesMar 23, 20221 citation

Efficient eCK-secure Authenticated Key Exchange Protocols in the Standard Model.

Zheng Yang

The extended Canetti–Krawczyk (eCK) security models, are widely used to provide security arguments for authenticated key exchange protocols that capture leakage of various kinds of secret information like the long-term private key and session-specific secret state. In this paper, we study the open problem on constructing eCK secure AKE protocol without random oracles and NAXOS like trick. A generic construction GC-KKN satisfying those requirements is first given relying on standard cryptographic primitives following the guideline of efficiency. On the second a concrete protocol is proposed which is the first eCK secure protocol in the standard model under both standard assumptions and post-specified peer setting. Both proposed schemes can be more efficiently implemented with secure device than previous eCK secure protocols in the standard model, where the secure device might be normally used to store the long-term private key and implement algorithms of protocol which require to be resilience of state leakage.

Jan 1, 20130 citations