oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
On the Security of Lee, Kim, Kim, & Oh Key Agreement Protocol  [cached]
Kim-Kwang Raymond Choo
International Journal of Network Security , 2006,
Abstract: In ICCSA 2005, Lee, Kim, Kim, & Oh proposed a new (two-party) ID-based key agreement protocol, which they claimed to provide known key security resilience, forward secrecy, key compromise resilience, unknown key share resilience, and key control, however, without providing any security proofs. In this work, we demonstrate that their claims of known key security resilience and key control are flawed by revealing previously unpublished flaw in the two-party ID-based key agreement protocol. We may speculate that such (trivial) errors could have been found by protocol designers if proofs of security were to be constructed, and hope this work will encourage future protocol designers to provide proofs of security. We conclude with a countermeasure due to Choo, Boyd, & Hitchcock (2005).
Efficient Password-Typed Key Agreement Scheme  [PDF]
Sattar J Aboud
International Journal of Computer Science Issues , 2010,
Abstract: In this paper, we will study Lee, Kim and Yoo, a verifier password typed key agreement scheme and demonstrate that the scheme is not secure. Then, the authors will propose an enhanced verifier typed key agreement scheme relied on Lee, Kim and Yoo scheme and demonstrate that the propose scheme resists against password guessing attack and stolen verifier attack. The authors are claimed that the proposed scheme is more secure and efficient compare with Lee, Kim and Yoo.
Efficient Password-Typed Key Agreement Scheme  [PDF]
Sattar J Aboud
Computer Science , 2010,
Abstract: In this paper, we will study Lee, Kim and Yoo, a verifier password typed key agreement scheme and demonstrate that the scheme is not secure. Then, the authors will propose an enhanced verifier typed key agreement scheme relied on Lee, Kim and Yoo scheme and demonstrate that the propose scheme resists against password guessing attack and stolen verifier attack. The authors are claimed that the proposed scheme is more secure and efficient compare with Lee, Kim and Yoo.
Authenticated Tripartite Key Agreement Protocol  [PDF]
Chunbo Ma,Jun Ao,Jianhua Li
Information Technology Journal , 2008,
Abstract: An authenticated tripartite key agreement mechanism based on Joux`s protocol is presented in this paper. The proposed protocol allows the three parties involved in the protocol to agree upon a common session key over an insecure network. The security of the proposed protocol is based on CDH problem and the strong hash function. Its security is improved under the random oracle model.
An Improvement of a Simple Authenticated Key Agreement Algorithm  [PDF]
Eric Jui-Lin Lu,Min-Shiang Hwang
Journal of Applied Sciences , 2002,
Abstract: Soe and Sweeney’s Simple Authenticated Key Agreement (SAKA) algorithm, based on the Diffie-Hellman method, is a password-based key agreement algorithm which is simpler than other published methods and prevents the man-in-middle attacks. However, SAKA is vulnerable to guessing attacks if passwords are poorly chosen. In this article, we further improve the SAKA method, which is simpler than the SAKA algorithm and can defeat both the man-in-the-middle and guessing attacks.
Authenticated Key Agreement Protocols: A Comparative Study  [PDF]
Areej Omar Baalghusun, Olfa Fahad Abusalem, Zahra Abbas Al Abbas, Jayaprakash Kar
Journal of Information Security (JIS) , 2015, DOI: 10.4236/jis.2015.61006
Abstract: One of the most important and challenging cryptographic primitives in Public Key Cryptography is Key Agreement Protocol where two or more parties share secret values and establish the session key. Many authors have proposed key agreement protocols. In this article, we have viewed some authenticated Key Agreement Protocols and presented a comparative study. We have also described the design principle, security requirement and various attacks on Key Agreement Protocol.
An Authenticated Key Agreement Protocol Using Conjugacy Problem in Braid Groups  [cached]
Atul Chaturvedi,Sunder Lal
International Journal of Network Security , 2008,
Abstract: In this paper we propose an authenticated key agreement, which works in a braid group. We prove that our protocol meet the security attributes under the assumption that the Conjugacy Search Problem (CSP) is hard in braid group.
Efficient Identity-Based and Authenticated Key Agreement Protocol  [PDF]
Yongge Wang
Computer Science , 2012,
Abstract: Several identity based and implicitly authenticated key agreement protocols have been proposed in recent years and none of them has achieved all required security properties. In this paper, we propose an efficient identity-based and authenticated key agreement protocol IDAK using Weil/Tate pairing. The security of IDAK is proved in Bellare-Rogaway model. Several required properties for key agreement protocols are not implied by the Bellare-Rogaway model. We proved these properties for IDAK separately.
An efficient certificateless authenticated key agreement protocol without bilinear pairings  [PDF]
Debiao He,Yitao Chen
Computer Science , 2011, DOI: 10.1016/j.mcm.2011.08.004
Abstract: Certificateless public key cryptography simplifies the complex certificate management in the traditional public key cryptography and resolves the key escrow problem in identity-based cryptography. Many certificateless authenticated key agreement protocols using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher than that of the scalar multiplication over elliptic curve group. Recently, several certificateless authenticated key agreement protocols without pairings were proposed to improve the performance. In this paper, we propose a new certificateless authenticated key agreement protocol without pairing. The user in our just needs to compute five scale multiplication to finish the key agreement. We also show the proposed protocol is secure in the random oracle model.
Authenticated Group Key Agreement Protocols for Ad hoc Wireless Networks  [cached]
Ahmed Abdel-Hafez,Ali Miri,Louis Orozco-Barbosa
International Journal of Network Security , 2007,
Abstract: The lack of fixed infrastructure, both physical and organizational, and the highly dynamic nature of ad hoc networks, presents a major challenge in providing secure, authenticated communication for these networks. Traditional key management solutions reported in the literature lack both the flexibility and robustness required to cope with the dynamic nature of ad hoc networks. In this paper, we propose two different $n$-party authenticated key agreement protocols enabling authorized nodes to generate their own session keys. The first protocol introduces a solution based on clustering techniques suitable for networks with partial structure and composed of a large number of nodes. The second protocol assumes no structure and provides authentication with a minimal increase in communication and computational overhead required.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.