Analysis and Improvement of a Security-Provable Mutually Authenticated Key Agreement Protocol
0
Citation
0
Reference
20
Related Paper
Abstract:
Deng, et al. proposed a security-provable mutually authenticated key agreement protocol MAKAP for mobile communication in 2003. This paper demonstrates by mounting an effective attack against MAKAP that the protocol has security flaws. It is vulnerable against unknown key-share attack. This paper investigates the reasons why such flaws exist and proposes an improved protocol version (called MAKAP-I protocol). The MAKAP-I protocol is not only provably secure within the random oracle model but also more efficient and practical in terms of computation and communication cost memory requirement and implementation cost, than the original MAKAP protocol.Keywords:
Provable security
Random oracle
Key-agreement protocol
Oakley protocol
Cite
How to construct secure key agreement protocol is one of the most challenging problems in information security area.However,most of the current secure protocols can only achieve heuristic security,the security assumptions and efficiencies of these protocols are not perfect.To solve these problems,the authors propose a new 2 rounds two-party authenticated key agreement protocol and point out some principles to construct a secure protocol by analyzing the security properties of the protocol,then prove strictly that the new protocol is secure in eCK model.According to pertinent literature,eCK model provides the strongest definition of security for two party key agreement protocol at present.Performance analysis shows that the protocol has a good balance between computational cost and security assumption.The authors also present a three-round variant of the protocol to realize key conformation property.
Oakley protocol
Authenticated Key Exchange
Key-agreement protocol
Security association
Cite
Citations (0)
In a 2005 IACR report, Wang published an efficient identity-based key agreement protocol (IDAK) suitable for resource constrained devices. The author shows that the IDAK key agreement protocol is secure in the BellareRogaway model with random oracles and also provides separate ad-hoc security proofs claiming that the IDAK protocol is not vulnerable to Key Compromise Impersonation attacks and also enjoys Perfect Forward Secrecy (PFS). In this report, we review the security properties of the protocol and point out that it is vulnerable to Unknown Key Share attacks. Although such attacks are often difficult to setup in a real world environment they are nevertheless interesting from a theoretical point of view so we provide a version of the protocol that fixes the problem in a standard way. We also provide a security proof of the IDAK protocol based on the Gap Bilinear Diffie Hellman and random oracle assumptions in the stronger extended Canetti-Krawczyk security model of distributed computing.
Random oracle
Key-agreement protocol
Forward secrecy
Cite
Citations (0)
Authenticated key agreement protocols have an important role in building secure communications between two or more parties over the open network. In this paper we propose an efficient and secure authenticated key agreement protocol based on RSA factoring and Discrete Logarithm Problem (DLP). We try to design strong protocol depends on the relation between two assumption (RSA factoring and DLP). We show that our protocol meets the security attributes and strong against most of potential attacks.
Key-agreement protocol
Cite
Citations (2)
Most Identity-based Authenticated Key Agreement(ID-AKA) protocols have poor performance on security and the efficiency.To solve this problem,this paper presents an improved ID-AKA protocol.Security proof with the modular approach in the mBR model is provided,which means the new protocol satisfies perfect forward security,PKG forward security,resistant to key-compromise impersonation.Furthermore,the new protocol can satisfy resistance to leakage of ephemeral secrets.Compared with previous ID-AKA protocols which can satisfy the same security properties,the new protocol has higher efficiency.
AKA
Provable security
Ephemeral key
Security association
Key-agreement protocol
Cite
Citations (0)
Key-agreement protocol
Provable security
Oakley protocol
Cite
Citations (18)
Provable security
Session key
Forward secrecy
Cite
Citations (6)
Two-party authenticated key agreement is one of the methods to generate session keys.In this paper,the authors analyzed a new provably secure two-party authenticated key agreement protocol proposed in 2011 by Jianjie Zhao et al.and pointed out that this protocol was not secure if the adversary can obtain the long-term key of a participant.Then an improved protocol was presented,and in the new scheme,the parameters that may leak the long-term keys were encrypted.The authors also discussed the security and computational cost of the new scheme.The result shows that the new protocol realizes the secure key agreement with lower computational cost.
Session key
Key-agreement protocol
Key encapsulation
Cite
Citations (0)
Session key
Oakley protocol
Key-agreement protocol
Cite
Citations (7)
Group key
Key-agreement protocol
Dictionary attack
Cite
Citations (0)
Deng, et al. proposed a security-provable mutually authenticated key agreement protocol MAKAP for mobile communication in 2003. This paper demonstrates by mounting an effective attack against MAKAP that the protocol has security flaws. It is vulnerable against unknown key-share attack. This paper investigates the reasons why such flaws exist and proposes an improved protocol version (called MAKAP-I protocol). The MAKAP-I protocol is not only provably secure within the random oracle model but also more efficient and practical in terms of computation and communication cost memory requirement and implementation cost, than the original MAKAP protocol.
Provable security
Key-agreement protocol
Security Analysis
Cite
Citations (2)