aqora

Provable Secure ID-Based Authenticated Key Agreement Protocol

Haiying Gao

Journal of Computer Research and DevelopmentAug 15, 20122 citations

A Provable Secure and Escrow-able Authenticated Group Key Agreement Protocol without NAXOS Trick

Shaheena Khatoon, Tejeshwari Thakur, Balwant Singh

We present an ID-based escrow-able authenticated group key agreement (AGKA) protocol which is provably secure in random oracle model.Additionally, the proposed protocol neither involve NAXOS trick nor uses gap assumption.And the security is proven in stronger eCK model.To our best knowledge, the proposed protocol will be first provable Secure and escrow-able ID based authenticated group key agreement protocol without NAXOS trick in eCK model.

International Journal of Computer ApplicationsAug 17, 20171 citation

An Efficient ID-Based Authenticated Key Agreement Protocol with Pairings

Jai-Boo Oh, Eun‐Jun Yoon, Kee-Young Yoo

Lecture notes in computer scienceJan 1, 200714 citations

A Provable Secure ID-Based Explicit Authenticated Key Agreement Protocol Without Random Oracles

田海博, Willy, Susilo +2 more

在这篇论文，我们在场没有随机的神谕，是 provably 安全的一个基于身份的明确的证实的关键一致性协议。协议采用一个新方法从关键证实钥匙孤立一个会话关键字以便没有在协议的散列函数的直接用法。没有随机的神谕，协议在 Bellare 和 Rogaway 风格模型，的变体被证明安全一个例外到在在基于标志的背景的这个风格模型的当前的验证法。我们相信这关键隔离法是新奇的并且能进一步为构造更多的有效协议被学习。这篇文章的联机版本(做 i：10.1007/s11390-008-9178-z ) 包含增补材料，它对授权用户可得到。在这篇论文，我们在场没有随机的神谕，是 provably 安全的一个基于身份的明确的证实的关键一致性协议。协议采用一个新方法从关键证实钥匙孤立一个会话关键字以便没有在协议的散列函数的直接用法。没有随机的神谕，协议在 Bellare 和 Rogaway 风格模型，的变体被证明安全一个例外到在在基于标志的背景的这个风格模型的当前的验证法。我们相信这关键隔离法是新奇的并且能进一步为构造更多的有效协议被学习。这篇文章的联机版本(做 i：10.1007/s11390-008-9178-z ) 包含增补材料，它对授权用户可得到。

Journal of Computer Science and TechnologyJan 1, 20080 citations

An Efficient ID-Based Authenticated Key Agreement Protocol from Pairings

Eun‐Kyung Ryu, Eun‐Jun Yoon, Kee-Young Yoo

Lecture notes in computer scienceJan 1, 200447 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.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

A Provable Secure ID-Based Explicit Authenticated Key Agreement Protocol Without Random Oracles

Related papers

A Provable Secure ID-Based Explicit Authenticated Key Agreement Protocol Without Random Oracles

Related papers