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
Proceedings ArticleDOI
11 Mar 2002
TL;DR: This paper presents and analyses the protocol with respect to its robustness against malicious attacks and concludes that this authentication protocol is a perfect candidate for the offline generation and validation of a disposable credit card number.
Abstract: Context free grammars present the desirable cryptographic property that it is easy to generate and validate strings from a given grammar, however it is hard to identify a grammar given only the strings generated by it. The algorithm used in the authentication protocol proposed in this paper makes use of context free grammars. This authentication protocol is a perfect candidate for the offline generation and validation of a disposable credit card number. The proposed protocol can be used alone and it does not rely on any other cryptographic protocols like SSL for its security. This paper presents and analyses the protocol with respect to its robustness against malicious attacks.

7 citations

DOI
01 Jan 2009
TL;DR: This paper proposes a novel mutual entity authentication using the TESLA protocol that not only provides secure bilateral authentication, but also decreases the call setup time and the required connection bandwidth.
Abstract: A B S T R A C T The widespread use of wireless cellular networks has made security an ever increasing concern. GSM is the most popular wireless cellular standard, but security is an issue. The most critical weakness in the GSM protocol is the use of one-way entity authentication, i.e., only the mobile station is authenticated by the network. This creates many security problems including vulnerability against man-in-the-middle attacks. Several solutions have been proposed to establish mutual entity authentication. However, none provide a aw-free bilateral authentication protocol. In this paper, we show that a recently proposed solution is vulnerable to a "type attack". Then, we propose a novel mutual entity authentication using the TESLA protocol. The proposed solution not only provides secure bilateral authentication, but also decreases the call setup time and the required connection bandwidth. An important feature of the proposed protocol is that it is compatible with the GSM standard.

7 citations

Journal ArticleDOI
TL;DR: It is shown that the cryptographic MAC protocol for key exchange protocol can be implemented using finite input-output automata with some small modification of the finite state machine.

7 citations

Journal ArticleDOI
TL;DR: This paper models IEEE802.11w authentication protocol by formal verification using CasperFDR and analyzes the output, finding a few attacks in this protocol.

7 citations

Proceedings ArticleDOI
19 Jul 2005
TL;DR: After showing the vulnerability of the ASK protocol using formal verification approach, a modification is proposed, and it is shown that the new protocol is secure against replay attack.
Abstract: Generally, security protocols have been designed and verified using informal techniques. In the result, it is now well recognized that many security protocols which were previously proposed have found to be vulnerable later on. In this paper, we model and verify of the ASK protocol, which is a complicated mobile security protocol. After showing the vulnerability of the ASK protocol using formal verification approach, we propose a modification, and then show that the new protocol is secure against replay attack

7 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