Topic
Otway–Rees protocol
About: Otway–Rees protocol is a research topic. Over the lifetime, 1975 publications have been published within this topic receiving 40569 citations.
Papers published on a yearly basis
Papers
More filters
15 Aug 2008
TL;DR: An improved authentication key agreement protocol based on elliptic curve for wireless mobile networks that can enhance the security of A- Key distribution protocol in 3GPP2.
Abstract: With the popularity of wireless communication, the security of mobile networks becomes more and more important. However, due to the computation limitation, many existing authentication key agreement protocols are not suitable for wireless mobile networks. In 2005, Sui et al. proposed an efficient authentication key agreement protocol, but their protocol can not resist the off-line password guessing attack. Therefore, Lu et al. present an enhanced authentication key agreement protocol to against this attack. However, we find that their protocol can not withstand the parallel guessing attack. Here, we propose an improved authentication key agreement protocol based on elliptic curve for wireless mobile networks that can enhance the security of A- Key distribution protocol in 3GPP2.
16 citations
18 May 2014
TL;DR: Performance analysis shows that this protocol does not only provide high efficient authentication, but also can resist attacks like offline password guessing attack, smart card loss attack, impersonation attack and so on.
Abstract: Efficient authentication in the vehicular networks has been studied by several researchers in the past. However, there are still several issues to be addressed like high communication/ computation overhead, security problems, etc. In this paper, we propose an Efficient Authentication Protocol (EAP) for secure vehicular communication. This protocol employs smart cards based on users(vehicles)' passwords and identities to provide strong user authentication, and uses dynamic login identities to provide the anonymity of authentication. Performance analysis shows that this protocol does not only provide high efficient authentication, but also can resist attacks like offline password guessing attack, smart card loss attack, impersonation attack and so on.
16 citations
TL;DR: This paper proposes an efficient and secure AKA protocol namely ES-AKA to prevent the UMTS network against these problems and attacks, and solves the synchronization problem occurred between a mobile station MS and its home network HLR.
Abstract: The authentication and key agreement (AKA) protocol of the Universal Mobile Telecommunication System (UMTS) was proposed to solve the vulnerabilities found in the Global System for Mobile Communications (GSM) systems. The UMTS-AKA provides mutual authentication, but is still vulnerable to redirection attack, denial of service attack, and man-in-the-middle attack. Apart from various attacks possibilities, the UMTS-AKA has a problem of counter synchronization, generates huge overhead, and utilizes more bandwidth and message exchanges during the authentication. An intruder may apply these attacks to impersonate the network or mischarge the mobile users. In this paper, we propose an efficient and secure AKA protocol namely ES-AKA to prevent the UMTS network against these problems and attacks. This protocol also solves the synchronization problem occurred between a mobile station MS and its home network HLR. The ES-AKA protocol generates lesser communication overhead as compared to UMTS-AKA, EXT-AKA, COCKTAIL-AKA, SKA-AKA, AP-AKA, X-AKA, EURASIP-AKA, Full-AKA, and U-AKA protocols. In addition, it also generates less computation overhead than the UMTS-AKA, EXT-AKA, COCKTAIL-AKA, S-AKA, Full-AKA, and U-AKA protocols. On an average, the ES-AKA protocol reduces 62 % of the bandwidth, which is the maximum reduction of the bandwidth by any AKA protocol referred in the paper. This protocol is also able to reduce 6 % of the messages exchanged (in terms of computations) during the authentication in comparison to UMTS-AKA.
16 citations
Posted Content•
TL;DR: This protocol is the first one in which users can authenticate each other without previously shared secret and then securely distribute a key where the key may not be exposed to even a trusted third party.
Abstract: We propose a quantum key distribution protocol with quantum based user authentication Our protocol is the first one in which users can authenticate each other without previously shared secret and then securely distribute a key where the key may not be exposed to even a trusted third party The security of our protocol is guaranteed by the properties of the entanglement
16 citations
01 Jan 2004
TL;DR: This paper introduces a novel approach to the automation of such a deductive reasoning process for logic based security protocol verification that results in a comparatively simple - but powerful - proving system.
Abstract: Secure communications over insecure networks relies on the security of cryptographic protocols. Formal verification is an essential step in the design of security protocols. In particular logic-based verification has been shown to be effective and has discovered a number of protocol flaws. However, manual application of the deductive reasoning process is complex, tedious and prone to error. This paper introduces a novel approach to the automation of such a deductive reasoning process. This new approach results in a comparatively simple - but powerful - proving system for logic based security protocol verification.
16 citations