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

Lecture notes in computer science

Credential Authenticated Identification and Key Exchange

Jan L. Camenisch, Nathalie Casati, Thomas Groß, Victor Shoup

Published Jan 1, 2010• 35 citations
Publisher
DOI
10.1007/978-3-642-14623-7_14

Related papers

Secure Key Exchange and Sessions without Credentials

Ran Canetti, Vladimir Kolesnikov, Charles Rackoff +1 more

Lecture notes in computer science•Jan 1, 2014•3 citations

Authentication and authenticated key exchanges

Whitfield Diffie, Paul C. van Oorschot, Michael J. Wiener

Designs Codes and Cryptography•Jun 1, 1992•1,155 citations

A Secure Authenticated Key Exchange Protocol for Credential Services

SeongHan Shin, Kazukuni Kobara, H. IMAI

In this paper, we propose a leakage-resilient and proactive authenticated key exchange (called LRP-AKE) protocol for credential services which provides not only a higher level of security against leakage of stored secrets but also secrecy of private key with respect to the involving server. And we show that the LRP-AKE protocol is provably secure in the random oracle model with the reduction to the computational Difie-Hellman problem. In addition, we discuss about some possible applications of the LRP-AKE protocol.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2008•4 citations

Server-Controlled Identity-Based Authenticated Key Exchange

Hua Guo, Yi Mu, Xiyong Zhang +1 more

Lecture notes in computer science•Jan 1, 2009•1 citation

Authenticated Key Exchange with Synchronized States.

Zheng Yang

Abstract. Nowadays, most of sensitive applications over insecure network are protected by some authenticated secure channel which is highly relies on specific authenticated key exchange (AKE) protocol. Nevertheless, the leakage of authentication credential used in AKE protocol somehow result in unauthorized exploitation of credential information via identity impersonation (IDI) attack. To address the problem of IDI, we introduce a new dynamic authentication factor for AKE protocols, i.e., the secret execution states, to either prevent IDI attack by detecting attempts thereof, or limit its consequences by on-line detecting situations of previously unidentified IDI. In this paper, we model the security for authenticated key exchange with synchronized states (AKESS) based on Bellare-Rogaway model, and we particularly formalize the IDI and IDI detection. We propose a generic execution states synchronization framework for AKE, in which we utilize the session key to generate the secret execution states on both sides, and present a new AKESS protocol which is provably secure in the standard model. Our goal is to enhance the security of existing authenticated key exchange with long-lived key (AKELL) protocols by equipping them with the capabilities of both IDI prevention and detection without modifications on those protocols.

•Jan 1, 2011•0 citations

Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages.

Olivier Blazy, Céline Chevalier, David Pointcheval +1 more

Authenticated Key Exchange (AKE) protocols enable two parties to establish a shared, cryptographically strong key over an insecure network using various authentication means, such as cryptographic keys, short (i.e., lowentropy) secret keys or credentials. In this paper, we provide a general framework, that encompasses several previous AKE primitives such as (Verifier-based) Password-Authenticated Key Exchange or Secret Handshakes, we call LAKE for Language-Authenticated Key Exchange. We first model this general primitive in the Universal Composability (UC) setting. Thereafter, we show that the Gennaro-Lindell approach can efficiently address this goal. But we need smooth projective hash functions on new languages, whose efficient implementations are of independent interest. We indeed provide such hash functions for languages defined by combinations of linear pairing product equations. Combined with an efficient commitment scheme, that is derived from the highly-efficient UC-secure Lindell’s commitment, we obtain a very practical realization of Secret Handshakes, but also Credential-Authenticated Key Exchange protocols. All the protocols are UC-secure, in the standard model with a common reference string, under the classical Decisional Linear assumption.

•Jan 1, 2012•0 citations
In this paper, we propose a leakage-resilient and proactive authenticated key exchange (called LRP-AKE) protocol for credential services which provides not only a higher level of security against leakage of stored secrets but also secrecy of private key with respect to the involving server. And we show that the LRP-AKE protocol is provably secure in the random oracle model with the reduction to the computational Difie-Hellman problem. In addition, we discuss about some possible applications of the LRP-AKE protocol.
Abstract. Nowadays, most of sensitive applications over insecure network are protected by some authenticated secure channel which is highly relies on specific authenticated key exchange (AKE) protocol. Nevertheless, the leakage of authentication credential used in AKE protocol somehow result in unauthorized exploitation of credential information via identity impersonation (IDI) attack. To address the problem of IDI, we introduce a new dynamic authentication factor for AKE protocols, i.e., the secret execution states, to either prevent IDI attack by detecting attempts thereof, or limit its consequences by on-line detecting situations of previously unidentified IDI. In this paper, we model the security for authenticated key exchange with synchronized states (AKESS) based on Bellare-Rogaway model, and we particularly formalize the IDI and IDI detection. We propose a generic execution states synchronization framework for AKE, in which we utilize the session key to generate the secret execution states on both sides, and present a new AKESS protocol which is provably secure in the standard model. Our goal is to enhance the security of existing authenticated key exchange with long-lived key (AKELL) protocols by equipping them with the capabilities of both IDI prevention and detection without modifications on those protocols.
Authenticated Key Exchange (AKE) protocols enable two parties to establish a shared, cryptographically strong key over an insecure network using various authentication means, such as cryptographic keys, short (i.e., lowentropy) secret keys or credentials. In this paper, we provide a general framework, that encompasses several previous AKE primitives such as (Verifier-based) Password-Authenticated Key Exchange or Secret Handshakes, we call LAKE for Language-Authenticated Key Exchange. We first model this general primitive in the Universal Composability (UC) setting. Thereafter, we show that the Gennaro-Lindell approach can efficiently address this goal. But we need smooth projective hash functions on new languages, whose efficient implementations are of independent interest. We indeed provide such hash functions for languages defined by combinations of linear pairing product equations. Combined with an efficient commitment scheme, that is derived from the highly-efficient UC-secure Lindell’s commitment, we obtain a very practical realization of Secret Handshakes, but also Credential-Authenticated Key Exchange protocols. All the protocols are UC-secure, in the standard model with a common reference string, under the classical Decisional Linear assumption.