International Symposium on Information Theory and its Applications

Efficient ID-based key agreement protocol under the DLDH assumption without random oracles

Daisuke Moriyama, Hiroshi Doi

Published Dec 1, 2008• 2 citations

Abstract

In this paper, we propose a two party ID-based key agreement protocol without random oracles. Our protocol is proven under the Decision Linear Diffie-Hellman assumption and the most efficient in the existing protocols proven secure without random oracles to the best of our knowledge.

DOI: 10.1109/isita.2008.4895433

Related papers

Identity-Based Authenticated Key Agreement Protocols without Bilinear Pairing in Multiple PKG Environments

Junquan Li

The authors present an identity-based authenticated key agreement protocol without bilinear pairing in multiple PKG environments.Reduced to the standard computational Diffie-Hellman(CDH) assumption in the random oracle model,the protocol security is given a complete proof based on the security of proposed ID-based exponential challenge-response(XCR) signature scheme and dual challenge-response(DCR) signature scheme.Compared with previous identity-based authenticated key agreement protocols,the new protocol shows better performances.

Beijing Daxue Xuebao. ZirankexuebanJan 1, 20120 citations

An efficient protocol for two‐party explicit authenticated key agreement

Minghui Zheng, Huihua Zhou, Jing Chen

Summary Successful and efficient key management plays a critical role toward secured computing and communication systems. Many authenticated key agreement protocols have been proposed to meet the great challenges of information security. The two‐party key agreement protocol can be classified into two categories: implicit and explicit key authentications. This paper investigates the issue on authenticated two‐party key agreement protocol over an insecure public network and extends the existing implicit authenticated key agreement protocol into the explicit one by introducing the authenticators. The advantage of this explicit protocol is that it does not need any fixed public key infrastructure. Furthermore, this explicit protocol is provably secure in the random oracle under the Computation Gap Diffie‐Hellman assumption. Concurrency and Computation: Practice and Experience, 2013.© 2013 Wiley Periodicals, Inc.

Concurrency and Computation Practice and ExperienceDec 26, 201311 citations

Practical Certificateless Authenticated Two-party Key Protocol

Jian Shu

Recently,Lippold et al.proposed certificateless authenticated two-party key agreement with provable security,their scheme suffers from computation burden.Basesd on twin diffie-hellman problem introduced by Cash,Kiltz and Shoup,A new scheme using bilinear pair is proposed.When compared with Lippold's scheme,the proposed protocol,with the same message bandwidth,achieves efficiency in computational cost.The security of the proposed scheme has been proven in the random oracle model under CDH assumption and BDH assumption.

Journal of Chinese Computer SystemsJan 1, 20100 citations

Efficient strongly-secure identity-based authenticated key agreement protocol

Jian Shu

Most of the existing Identity-based(ID) authenticated protocols are proven secure in the Canetti-Krawczyk(CK) model which is weaker than the extended Canetti-Krawczyk(eCK) model.Based on NAXOS trick,a new scheme using bilinear pairing was proposed.The security of the scheme was proven in the eCK model under the random oracle assumption and the Gap Bilinear Diffie-Hellman(GBDH) assumption.The proposed protocol was efficient in computational cost and communication round when compared with other solutions.The new protocol also satisfied master key forward security,perfect forward security and anti-key-leak disguise.

Journal of Computer ApplicationsJan 1, 20120 citations

An Efficient Tripartite Identity-Based Authenticated Key Agreement Protocol

Xiaotong Fu, Shufang Guo, Ruijun Shi

In this paper, the tripartite identity-based key agreement is investigated. Inspired by designated verifier signature schemes, a tripartite identity-based key agreement protocol with explicit authentication is proposed with the good authentication of signatures. The new protocol can achieve remarkable security properties, such as perfect forward secrecy and unknown key share. More theoretically, the security proving of the protocol is given in the random oracle model under the Bilinear Diffie-Hellman assumption. The efficiency of the protocol is lying on that three parties can establish an agreed session key after only one round of message exchange. Detailed efficiency analysis compared with other protocols is also made.

International Conference on Intelligent Networking and Collaborative Systems (INCoS)Sep 1, 20132 citations

Strongly-Secure Identity-based Key Agreement and Anonymous Extension.

Sherman S. M. Chow, Kim‐Kwang Raymond Choo

Abstract. We study the provable security of identity-based (ID-based) key agreement protocols. Although several published protocols have been proven secure in the random oracle model, only a weak adversarial model is considered – the adversary is not allowed to ask Session-Key Reveal queries that will allow the adversary to learn previously established session keys. Recent research efforts devoted to providing a stronger level of security require strong assumptions, such as assuming that the simulator has access to a non-existential computational or decisional oracle. In this work, we propose an ID-based key agreement protocol and prove its security in the widely accepted indistinguishability-based model of Canetti and Krawczyk. In our proof, the simulator does not require access to any non-existential computational or decisional oracle. We then extend our basic protocol to support ad-hoc anonymous key agreement with bilateral privacy. To the best of our knowledge, this is the first protocol of its kind as previously published protocols are for fixed group and provide only unilateral privacy (i.e., only one of the protocol participants enjoy anonymity).

Jan 1, 20070 citations