scispace - formally typeset
Search or ask a question
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
More filters
01 Nov 2006
TL;DR: This work presents SPACE, an application-level protocol for secure automatic ad-hoc connection-establishment between two devices based on their address book entries, which is resistant to specific security attacks and can accommodate for privacy concerns.
Abstract: We present SPACE an application-level protocol for secure automatic ad-hoc connection-establishment between two devices based on their address book entries. Our protocol is based on the simple premise that if two people have each others contact details in their address books, they probably know and trust each other in some limited way and this can form a basis for a trust relationship between their devices, without additional user intervention. We show how our protocol is resistant to specific security attacks and can accommodate for privacy concerns. Existing connectionestablishment protocols for Bluetooth and IEEE 802.11 have known security flaws, and can be compromised using wellknown techniques and off-the-shelf hardware. In addition, these protocols require explicit user intervention, like entering a passkey. We believe that these factors have directly impacted the widespread application of ad-hoc networking in the context of mobile phones and other consumer devices.

3 citations

Proceedings ArticleDOI
24 Sep 2009
TL;DR: A new authentication and key exchange protocol is presented and the results of analysis indicate that the protocol is correct and satisfies the security requirements of the Internet key exchange.
Abstract: The security authentication and key negotiation is an important foundation of network security. In this paper, a new authentication and key exchange protocol is presented. The proposed protocol is logically analyzed with the BAN-logic and discussed as a secure protocol. The results of analysis indicate that the protocol is correct and satisfies the security requirements of the Internet key exchange

3 citations

Journal ArticleDOI
01 May 2005
TL;DR: Two authentication primitives proposed recently are used as a linguistic support for enforcing authentication and help in proving that a cryptographic protocol correctly implements its corresponding abstract version.
Abstract: We use two authentication primitives proposed recently as a linguistic support for enforcing authentication. They offer a way of abstracting from various specifications of authentication and of obtaining idealized protocols ''secure by construction''. Consequently, they help in proving that a cryptographic protocol correctly implements its corresponding abstract version; when the implementation is incorrect, suggestions on how to fix it may come from reasoning on the abstract specification.

3 citations

Proceedings ArticleDOI
01 Nov 2008
TL;DR: The improved authentication tests (I-ATs) have been proposed and the notion of message type is introduced for detecting the possibility of certain replay and interleaving attacks.
Abstract: Authentication tests are widely used in formal analysis, design and automatic verification of security protocols. However, they are not sufficient in proving symmetric key protocols, and fail to detect potential attacks on Neuman-Stubblebine protocol. By analyzing the failure reasons of authentication tests, some of their deficiencies have been pointed out. In order to break through these limitations of analytic capability of the original authentication tests, the improved authentication tests (I-ATs) have been proposed. In the I-ATs, the notion of message type is introduced for detecting the possibility of certain replay and interleaving attacks. The proofs of Neuman-Stubblebine protocol and Kao-Chow authentication protocol show that the I-ATs can easily find the type flaw attack on the initial authentication of Neuman-Stubblebine protocol, and give precise proof for Kao-Chow protocol.

3 citations

Journal Article
TL;DR: The aim of this paper is to verify and formalize the Kerberos protocol using NuSMV model checker and suggests CTL specifications for authentication, secrecy and integrity.
Abstract: Authentication is one of the biggest problem related to computer information security in the area of distributed environments. Various protocols are used for the authentication purpose such as Needham-Schroeder protocol Kerberos protocol etc. The aim of this paper is to verify and formalize the Kerberos protocol using NuSMV model checker. The protocol version used in this paper is Kerberos Authentication Protocol. The paper suggests CTL specifications for authentication, secrecy and integrity. We have also proposed an approach to identify presence of intruder in the system.

3 citations


Network Information
Related Topics (5)
Server
79.5K papers, 1.4M citations
86% related
Encryption
98.3K papers, 1.4M citations
86% related
Wireless ad hoc network
49K papers, 1.1M citations
85% related
Mobile computing
51.3K papers, 1M citations
84% related
Wireless sensor network
142K papers, 2.4M citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20239
202236
20211
20194
201812
201795