Pairing-Based Two-Party Authenticated Key Agreement Protocol.

Rongxing Lu, Zhenfu Cao, Renwang Su, Jun Shao

Published Jan 1, 2005• 6 citations

Abstract

Abstract. To achieve secure data communications, two parties should be authenticated by each other and agree on a secret session key by exchanging messages over an insecure channel. In this paper, based on the bilinear pairing, we present a new two-party authenticated key agreement protocol, and use the techniques from provable security to examine the security of our protocol within Bellare-Rogaway model. 1

Related papers

An efficient and secure one-round authenticated key agreement protocol without pairings

Mengbo Hou, Qiuliang Xu

Two-Party Authenticated key agreement protocol is essential for setting up the common session key for parties to establish secure channel for network communication in the open environment. Most of proposed schemes require expensive bilinear pairing operation and only provide limited security attributes. So such protocols are unsuitable for real-world applications that require stronger sense of secrecy. In this paper, we first analysis two schemes recently proposed by Cao etc., and then present a one-round ID-based authenticated key agreement protocol with more desired security attributes, which need no pairing operations while still achieve nice computational efficiency. These security attributes include known-key secrecy, perfect forward secrecy, PKG forward secrecy, key-compromise impersonation resilience, unknown key-share resilience and no key control. Moreover, it captures the enhanced security attributes known session-specific temporary key information secrecy, which means that even the ephemeral secret key were compromised, the adversary can hardly acquire the agreed session key.

International Conference on Multimedia Technology (ICMT)Jul 1, 20114 citations

Provably Secure Two-Party Explicit Authenticated Key Agreement Protocol

Minghui Zheng, Jing Chen

This paper considers the issue on authenticated two-party key agreement protocol over an insecure public network. Many authenticated key agreement protocols have been proposed to meet the challenges. Based on bilinear pairing, Zhou et al. proposed a two-party key agreement with implicit key authentication in 2011. Implicit key authentication can be easily achieved by encrypting the later communications using the session key. However, we can not ensure how participants using the session key protocol. This paper will transform the Zhou's implicit authenticated key agreement protocol into the explicit one with key confirmation by introducing the authenticators, and show the proposed protocol is provably secure under the random-oracle model.

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)Jun 1, 20120 citations

New authenticated key agreement protocols

Hassan M. A. Elkamchouchi, Yasmine A. Saleh, Aliaa M. Sary

Key agreement protocols are used to establish common keys between two or more entities. The established key can then be used to assure confidentiality of exchanged messages through encryption. Additionally, authenticated key agreement protocols offer implicit authentication. In this paper, new authenticated key agreement protocols are proposed and their security properties are investigated. We start by examining the two-party case and then develop extensions to three parties as well as extensions to any group of k parties. The proposed protocols try to keep exchanged messages and computations minimal, while offering adequate security guarantees. Finally, we develop a variant of our multi-party key agreement protocol tailored for secure group communications among mobile devices.

International Conference on Computer Engineering & Systems (ICCES)Nov 1, 201112 citations

Authenticated Session Key Distribution Protocol with Zero-Knowledge

Chungen Xu, Yan Yang, Bennian Dou

Authenticated session key distribution protocol is an important cryptographic technique in the secure communication areas. We present a new method for the authenticated exchange of messages in the three-party case, and abandon the idea of authentication which was finished with encryption and decryption in the Bellare-Rogaway model. Instead, the non-interactive zero-knowledge is applied to our protocol. We give an illumination for some important properties of security and depict a feasible idea of provably security with zero-knowledge.

Applied Mechanics and MaterialsDec 6, 20100 citations

Revisit Of McCullagh-Barreto Two-Party ID-Based Authenticated Key Agreement Protocols.

Kim‐Kwang Raymond Choo

The recently proposed two-party ID-based authenticated key agreement protocols (with and without escrow) and its variant resistant to key-compromise impersonation by McCullagh & Barreto are revisited. The protocol carries a proof of security in the Bellare & Rogaway (1993) model. In this paper, it is demonstrated that the protocols and its variant are not secure if the adversary is allowed to send a Reveal query to reveal non-partner players who had accepted the same session key.

Jan 1, 20043 citations

Generic Compilers for Authenticated Key Exchange

Tibor Jager, Florian Kohlar, Sven Schäge +1 more

So far, all solutions proposed for authenticated key agreement combine key agreement and authentication into a single cryptographic protocol. However, in many important application scenarios, key agreement and entity authentication are clearly separated protocols. This fact enables efficient attacks on the naïve combination of these protocols. In this paper, we propose new compilers for two-party key agreement and authentication, which are provably secure in the standard Bellare-Rogaway model. The constructions are generic: key agreement is executed first and results (without intervention of the adversary) in a secret session key on both sides. This key (or a derived key) is handed over, together with a transcript of all key exchange messages, to the authentication protocol, where it is combined with the random challenge(s) exchanged during authentication.

Jan 1, 20120 citations