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

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

Efficient Key Exchange and Authentication Protocols Protecting Weak Secrets

Taekyoung Kwon, JooSeok Song

Published Jan 25, 1998• 12 citations
OpenAlex

Related papers

A Security Weakness in a Generic Construction of a Group Key Exchange Protocol.

Junghyun Nam

Protocols for group key exchange are cryptographic algorithms that allow a group of parties communicating over a public network to come up with a common secret key. One of the interesting results of research on group key exchange is the protocol compiler presented by Abdalla et al. in TCC ’07. Abdalla et al.’s compiler shows how one can transform any authenticated 2-party key exchange protocol into an authenticated group key exchange protocol with 2 more rounds of communication. This compiler certainly is elegant in its genericness, sym-metricity, simplicity and efficiency. However, the situation completely changes when it comes to security. In this work, we reveal a major security weakness in Abdalla et al.’s compiler and show how to address it. The security weakness uncovered here implies that Abdalla et al.’s proof of security for their compiler is invalid.

•Jan 1, 2010•0 citations

Several practical protocols for authentication and key exchange

Chae Hoon Lim, Pil Joong Lee

Information Processing Letters•Jan 1, 1995•16 citations

Secure and minimal protocols for authenticated key distribution

Philippe A. Janson, Gene Tsudik

Computer Communications•Sep 1, 1995•27 citations

New Secret Key Exchange Based On Recent Cryptographic Schemes (Dept.E)

Amina Rashad, Magcd Ibrahim, Zaki Nossair

Authenticated key exchange protocols have an important role for building secure communications amongst two or more entities over the networks. Two party authenticated key exchange protocols where each pair of parties must share a secret with each other; a three-party protocol does not cause any key management problem for the parties. In this paper, an extension of two-party key exchange protocol, which is based on Diffie-Hellman key exchange. is proposed. In this protocol each user exchanges secret key with server then each user uses this secret key to exchange session key with each other. The efficiency and the security analysis of this new key exchange protocol are proven in this paper.

MEJ Mansoura Engineering Journal•Dec 5, 2020•0 citations

Designing secure key exchange protocols

Colin Boyd, Wenbo Mao

Lecture notes in computer science•Jan 1, 1994•18 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
Protocols for group key exchange are cryptographic algorithms that allow a group of parties communicating over a public network to come up with a common secret key. One of the interesting results of research on group key exchange is the protocol compiler presented by Abdalla et al. in TCC ’07. Abdalla et al.’s compiler shows how one can transform any authenticated 2-party key exchange protocol into an authenticated group key exchange protocol with 2 more rounds of communication. This compiler certainly is elegant in its genericness, sym-metricity, simplicity and efficiency. However, the situation completely changes when it comes to security. In this work, we reveal a major security weakness in Abdalla et al.’s compiler and show how to address it. The security weakness uncovered here implies that Abdalla et al.’s proof of security for their compiler is invalid.
Authenticated key exchange protocols have an important role for building secure communications amongst two or more entities over the networks. Two party authenticated key exchange protocols where each pair of parties must share a secret with each other; a three-party protocol does not cause any key management problem for the parties. In this paper, an extension of two-party key exchange protocol, which is based on Diffie-Hellman key exchange. is proposed. In this protocol each user exchanges secret key with server then each user uses this secret key to exchange session key with each other. The efficiency and the security analysis of this new key exchange protocol are proven in this paper.
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.