An efficient identity-based tripartite authenticated key agreement protocol

The tripartite authenticated key agreement protocol enables three entities to authenticate each other and agree on a session key over an insecure public network. In this paper, we propose an identity-based tripartite authenticated key agreement protocol. Compared with the previous identity-based tripartite authenticated key agreement protocols, the novel protocol requires only one round, lower communication cost and smaller computation cost. We provide security proof of the proposed protocol based on the intractability of the Bilinear Diffie–Hellman problem and intractability of the discrete logarithm problem in the random oracle model.     

格上具有完全前向安全的0轮往返时间密钥交换协议

0-RTT密钥交换协议允许客户端在零往返时间发送加密保护的有效载荷和第一条密钥交换协议消息,具有非交互、可离线等优点。为了降低密钥交换往返时间,基于穿透加密思想提出一种格上0-RTT密钥交换协议。首先利用一次性签名算法和分级身份基密钥封装机制构造可穿透前向保密密钥封装方案,然后使用可穿透前向保密密钥封装方案设计0-RTT密钥交换协议。协议只需客户端对服务器进行单向认证,并且能够有效抵抗量子攻击和重放攻击。与同类协议相比,所提协议具有可穿透的完全前向安全,减少了通信轮数,提高了通信效率。     

Deniability and forward secrecy of one-round authenticated key exchange

Deniability and forward secrecy are two properties of authenticated key exchange (AKE) protocols. Considering one-round AKE, Cremers and Feltz at ESORICS 2012 defined a security model with perfect forward secrecy. Based on their model, we consider different levels of deniability, and reveal some relationships of the session-key security and the deniability properties. The observations result in a simple method to give a deniable protocol with forward secrecy.     

An efficient dynamic authenticated key exchange protocol with selectable identities

In the traditional identity-based cryptography, when a user holds multiple identities as its public keys, it has to manage an equal number of private keys. The recent advances of identity-based cryptography allow a single private key to map multiple public keys (identities) that are selectable by the user. This approach simplifies the private key management. Unfortunately, the existing schemes have a heavy computation overhead, since the private key generator has to authenticate all identities in order to generate a resultant private key. In particular, it has been considered as a drawback that the data size for a user is proportional to the number of associated identities. Moreover, these schemes do not allow dynamic changes of user identities. When a user upgrades its identities, the private key generator (PKG) has to authenticate the identities and generate a new private key. To overcome these problems, in this paper we present an efficient dynamic identity-based key exchange protocol with selectable identities, and prove its security under the bilinear Diffie–Hellman assumption in the random oracle model.     

Perfect forward secure identity-based authenticated key agreement protocol in the escrow mode

The majority of existing escrowable identity-based key agreement protocols only provide partial forward secrecy. Such protocols are, arguably, not suitable for many real-word applications, as the latter tends to require a stronger sense of forward secrecy—perfect forward secrecy. In this paper, we propose an efficient perfect forward-secure identity-based key agreement protocol in the escrow mode. We prove the security of our protocol in the random oracle model, assuming the intractability of the Gap Biline...     

An efficient password-based three-party authenticated multiple key exchange protocol for wireless mobile networks

With the rapid development of wireless mobile communication, the password-based three-party authenticated key exchange protocol has attracted an increasing amount of attention. To generate more session keys at one time for different applications, Li et al. proposed a password-based three-party authenticated multiple key exchange (3PAMKE) protocol for wireless mobile networks. They claimed that their protocol could withstand various attacks. In this paper, we will show Li et al.’s protocol is not secure off-line password guessing. Furthermore, we proposed an improved 3PAMKE protocol to overcome weakness in Li et al.’s protocol. Security analysis and performance analysis shows our protocol not only overcomes security weakness, but also has better performance. Therefore, our protocol is more suitable for wireless mobile networks.     

An improved two-party identity-based authenticated key agreement protocol using pairings

Two-party authenticated key agreement protocols using pairings have gained much attention in the cryptographic community. Several protocols of this type where proposed in the past of which many were found to be flawed. This resulted in attacks or the inability to conform to security attributes. In this paper, we propose an efficient identity-based authenticated key agreement protocol employing pairings which employs a variant of a signature scheme and conforms to security attributes. Additionally, existing competitive and the proposed protocol are compared regarding efficiency and security. The criteria for efficiency are defined in this paper, whereas the criteria for security are defined by the fulfilment of security attributes from literature.     

An improved identity-based key agreement protocol and its security proof

We revisit the identity-based (ID-based) key agreement protocol due to Ryu et al. The protocol is highly efficient and suitable for real-world applications despite offering no resilience against key-compromise impersonation (K-CI). We show that the protocol is also insecure against reflection attacks. We propose a slight modification to the protocol and prove its security in a widely accepted model.     

One-round identity-based key exchange with Perfect Forward Security

Identity-based authenticated key exchange (IBAKE) protocol is one of the most important cryptographic primitives that enables two parties using their identities to establish their common secret keys without sending and verifying public key certificates. Recently, many works have been dedicated to design efficient and secure IBAKE protocols without bilinear pairings which need the heavy computational cost. Unfortunately, most of the proposed protocols cannot provide Perfect Forward Security (PFS) which is a major security goal of authenticated key exchange protocols. In this paper we present an efficient and provably secure IBAKE protocol with PFS. Our protocol relies on the technique known as the concatenated Schnorr signature and it could be viewed as a variant of the protocol proposed by Fiore et al. in 2010. By using the Canetti–Krawczyk security model, we prove that the protocol is secure with PFS under the Computational Diffie–Hellman assumption in the random oracle model. The protocol is of interest since it offers a remarkable combination of advanced security properties and efficiency and its security proof is succinct and intelligible.     

An efficient three-party authenticated key exchange protocol using elliptic curve cryptography for mobile-commerce environments

For secure communications in public network environments, various three-party authenticated key exchange (3PAKE) protocols are proposed to provide the transaction confidentiality and efficiency. In 2008, Chen et al. proposed a round-efficient 3PAKE protocol to provide the computation and communication efficiency for user authentication and session key exchange. However, we discover that the computation costs and communication loads of their protocol are still high so that it cannot be applied to mobile communications. Therefore, we propose an efficient three-party authenticated key exchange protocol based upon elliptic curve cryptography for mobile-commerce environments. Because the elliptic curve cryptography is used, the proposed 3PAKE protocol has low computation costs and light communication loads. Compared with Chen et al.’s protocol, the proposed protocol is more suitable and practical for mobile-commerce environments.     

Escrowable identity-based authenticated key agreement protocol with strong security

Escrowable identity-based authenticated key agreement protocols are welcome in certain closed groups applications, where audit trail is a legal requirement. In this paper, we present a strongly secure one-round escrowable identity-based two-party authenticated key agreement protocol, which captures all basic desirable security properties including perfect forward secrecy, ephemeral secrets reveal resistance and so on, and is provably secure in the extended Canetti–Krawczyk (eCK) model. We show that the security of the protocol can be reduced to the standard computational bilinear Diffie–Hellman assumption in the random oracle model. Assuming that no adversary can obtain the master private key for the escrow mode, our scheme is secure as long as each party has at least one uncompromised secret. To the best of our knowledge, our scheme is the first escrowable identity-based authenticated key agreement protocol provably secure in the eCK model.     

具有PFS特性的流媒体安全通信协议

设计面向可伸缩媒体流的安全通信协议以保证可伸缩流媒体服务系统能够为相同的节目源设计不同质量等级的输出码流并确保安全传输。通信协议由客户端、认证服务器和视频服务器3个实体的交互完成,通过基于Diffie-Hellman算法的密钥交换和基于证书机制的双向认证确保产生的临时会话密钥的机密性和通信过程的PFS特性。通过采用CBC模式的对称加密算法、ID与随机数的串接以及用临时密钥加密密钥协商消息等安全机制来确保增强的安全性以抵抗反射攻击和中间人攻击。     

高效的强安全的基于身份认证密钥协商协议

现有的基于身份(ID)认证协议大多在CK模型中被证明是安全的,而CK模型比扩展的CK模型(eCK模型)更弱。基于NAXOS方法,利用双线性对设计了一种新协议,并基于随机预言假设和GBDH假设,在eCK模型中证明了协议的安全性。与其他的基于身份认证协议相比,新协议的计算复杂度和通信复杂度较低;满足主密钥前向安全性和完美前向安全性,并抗密钥泄漏伪装。     

New identity-based three-party authenticated key agreement protocol with provable security

Key agreement allows multi-parties exchanging public information to create a common secret key that is known only to those entities over an insecure network. In the recent years, several identity-based (ID-based) authenticated key agreement protocols have been proposed and most of them broken. In this paper, we formalize the security model of ID-based authenticated tripartite key agreement protocol and propose a provably secure ID-based authenticated key agreement protocol for three parties with formal security proof under the computational Diffie–Hellman assumption. Experimental results by using the AVISPA tool show that the proposed protocol is secure against various malicious attacks.     

An efficient protocol for anonymous and fair document exchange

Fairness in document exchange has been well studied, while anonymity in the exchange, which protects the privacy of personal information such as identities and locations, has been either ignored or handled with partial or inappropriate considerations. In this paper we propose a new protocol for anonymous and fair document exchange between two parties with the assistance of an off-line trusted third party. The new protocol treats both fairness and anonymity as essential properties, employs an efficient method for off-line key recovery, and places weak requirements on the security of the third party.     

An efficient and practical threshold gateway-oriented password-authenticated key exchange protocol in the standard model

With the assistance of an authentication server, a gateway-oriented password-authenticated key exchange (GPAKE) protocol can establish a common session key shared between a client and a gateway. Unfortunately, a GPAKE protocol becomes totally insecure if an adversary can compromise the authentication server and steal the passwords of the clients. In order to provide resilience against adversaries who can hack into the authentication server, we propose a threshold GPAKE protocol and then present its security proof in the standard model based on the hardness of the decisional Diffie-Hellman (DDH) problem. In our proposal, the password is shared among n authentication servers and is secure unless the adversary corrupts more than t+1 servers. Our protocol requires n > 3t servers to work. Compared with existing threshold PAKE protocols, our protocol maintains both stronger security and greater efficiency.     

An novel three-party authenticated key exchange protocol using one-time key

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 propose 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.     

A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges

Based on the computational Diffie-Hellman problem, this paper proposes an identity-based authenticated key agreement protocol which removes bilinear pairings. Compared with previous protocols, the new protocol minimizes message exchange time with no extra cost. The protocol provides strong security guarantees including key compromise impersonation resilience, perfect forward secrecy, and master key forward secrecy. A security proof with the modular approach in the modified Bellare-Rogaway model is also provided.     

An efficient and non-interactive hierarchical key agreement protocol

The non-interactive identity-based key agreement schemes are believed to be applicable to mobile ad-hoc networks (MANETs) that have a hierarchical structure such as hierarchical military MANETs. It was observed by Gennaro et al. (2008) that there is still an open problem on the security of the existing schemes, i.e., how to achieve the desirable security against corrupted nodes in the higher levels of a hierarchy? In this paper, we propose a novel and very efficient non-interactive hierarchical identity-based key agreement scheme that solves the open problem and outperforms all existing schemes in terms of computational efficiency and data storage.