Jisuanji gongcheng

Multiple Key Exchange Protocol with Strong Security

Zhang Shi-wu

Published Jan 1, 2011• 0 citations

Abstract

All existing two party multiple key exchange protocols cannot resist ephemeral key compromise attack.To solve this problem,a new two party authenticated key exchange protocol based bilinear map is proposed for enhancing the security and efficiency of two party key exchange protocols.Four different session keys can be computed through one session of the proposed protocol.Compared with existing protocols,the new protocol with stronger security can resist ephemeral key compromise attack and provide mutual authentication.

Related papers

An Efficient Three-Party Authenticated Key Exchange Protocol with One-Time Key

Chao Lv, Maode Ma, Hui Li +1 more

Three-party authenticated key exchange protocol (3PAKE) is an important cryptographic technique for secure communication which allows two parties to agree a new secure session key with the help of a trusted server. In this paper, we proposed a new three-party authenticated key exchange protocol which aims to achieve more efficiency with the same security level of other existing 3PAKE protocols. Security analysis and formal verification using AVISPA tools show that the proposed protocol is secure against various known attacks. Comparing with other typical 3PAKE protocols, the proposed protocol is more efficient with less computation complexity.

IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)Mar 1, 20107 citations

An efficient two-party key exchange protocol with strong security

Shao-feng DENG, LI Yi-fa, Yiqun Deng

Combined public key (CPK) cryptography does not need certificates to guarantee the authenticity of public keys and avoids the inherent key escrow problem of identity-based cryptography. Based on the efficient CPK scheme, we present an efficient three-round two-party authenticated key exchange protocol with strong security, which is provably secure in the standard model under the decisional Diffie-Hellman (DDH) assumption. The protocol can keep the session key secret from the adversary except that one party’s ephemeral private key and static private key are all revealed to the adversary. Compared to the existing protocols, this protocol not only assures strong security but also is more efficient.

Wuhan University Journal of Natural SciencesMay 12, 20102 citations

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

Cryptanalysis of a New Efficient Authenticated Multiple- Key Exchange Protocol from Bilinear Pairings

Qingfeng Cheng

Multiple-key exchange (MKE) protocols allow two parties to generate two or more shared session keys over insecure networks. In recent years, many MKE protocols have been proposed. However, most of them still have some security flaws. In this letter, we will analyze a new MKE protocol proposed by Farash et al. in 2012, and present two attacks against Farash et al.’s protocol.

International journal of network securityJan 1, 20143 citations

Certificateless two-party key agreement scheme without bilinear pairing

XU Chun-xiang

A few of certificateless key agreement schemes have been proposed in recent years,all of them need pairing operations,what's more,most of them are vulnerable to the key compromise impersonation attack and resistance to leakage of ephemeral keys.The provably secure certificateless key agreement protocol was proposed by Lippold in 2009,but their protocol suffered from computation burden.In order to solve the above-mentioned problem,this paper proposed a new pairing-free certificateless two party key agreement scheme (CL-KA) and presened its security properties.The new scheme was secure as long as each party had at least one uncompromised secret.Thus,the new scheme was secure even if the key generation centre learned the ephemeral secrets of both parties.The new scheme achieves efficiency in computational cost when compared with Lippold's protocol.

Jisuanji yingyong yanjiuJan 1, 20103 citations

Cryptanalysis of an Identity-Based Multiple Key Agreement Scheme.

Qingfeng Cheng

Multiple key agreement (MKA) protocols allow two parties to generate two or more session keys in one session, which will be used for future secure communications in public network. In recent years, many MKA protocols have been proposed. However, most of them do not consider ephemeral key compromise resilience, and some of them still exists security flaws. In this paper, we analyze the scheme proposed by Dehkordi and Alimoradi in 2011, which is announced with stronger security. We will present ephemeral key compromise attack and impersonation attack against Dehkordi and Alimoradi’s protocol. For overcoming these security flaws, we also propose an improvement of Dehkordi and Alimoradi’s protocol.

Jan 1, 20121 citation