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
Journal ArticleDOI
TL;DR: A new security protocol with satisfying the lightweight requirements of the security of RFID system using varying identifiers that can resist Forward attack, Traffic analysis and Tracking attack, Replay attack is proposed.
Abstract: This article proposed a new security protocol with satisfying the lightweight requirements of the security of RFID system. Using varying identifiers, the protocol can resist Forward attack, Traffic analysis and Tracking attack, Replay attack. The Back-end Server holds the new identifier and last identifier for every Tag can keep database synchronization. Each Tag store a unique Key that is the secret information which also store in the Back-end Server. Use the Key, the protocol can implement mutual authentication between Back-end Server and Tag. Then the paper compared the proposed protocol with the typical protocols in security, effective and cost. The results demonstrate that the protocol can effectively solve the security problem of RFID systems.

4 citations

Proceedings ArticleDOI
03 Dec 2007
TL;DR: Two extensions of the strand space method to model Kerberos V are presented, including time and timestamps to model security protocols with times- tamps and a new relation rarr to model the causal relation between one primary protocol session and one of its following secondary protocol session.
Abstract: In this paper, we present two extensions of the strand space method to model Kerberos V. First, we include time and timestamps to model security protocols with times- tamps: we relate a key to a crack time and combine it with timestamps in order to define a notion of recency. Therefore, we can check replay attacks in this new framework. Second, we extend the classic strand space theory to model protocol mixture. The main idea is to introduce a new relation rarr to model the causal relation between one primary protocol session and one of its following secondary protocol session. Accordingly, we also revisit the definition of unsolicited authentication test. To demonstrate the power of this new theory, we model the Kerberos V protocol, and prove its secrecy and authentication goals. Our framework and the proofs of the example have been mechanized using Isabelle/HOL.

4 citations

Proceedings ArticleDOI
03 Oct 2011
TL;DR: Results show that cross-layer information can facilitate replay detection with low overhead and high detection rates.
Abstract: In this paper, replay attacks in tactical Mobile Ad hoc Networks (MANET) are analyzed and a distributed detection scheme is proposed that leverages statistics obtained across multiple protocol layers. The proposed scheme is evaluated employing realistic tactical radio models and network scenarios. The results show that cross-layer information can facilitate replay detection with low overhead and high detection rates.

4 citations

Book ChapterDOI
26 Aug 2007
TL;DR: This paper proposes a new authentication protocol for UMTS that overcomes the drawbacks of the UMTS AKA and enhances the security of the protocol by providing better privacy and also provides perfect forward secrecy.
Abstract: In UMTS (Universal Mobile Telecommunication System), a protocol called UMTS AKA (Authentication and Key Agreement) is used to securely authenticate an MS (Mobile Station) However, the UMTS AKA has several drawbacks such as network bandwidth consumption and synchronization problem In this paper, we propose a new authentication protocol for UMTS that overcomes these problems Moreover, our protocol enhances the security of the protocol by providing better privacy and also provides perfect forward secrecy Furthermore, our protocol also provides mutual authentication between an MS and its HN (Home Network) and between an MS and the SN (Serving Network)

4 citations

Journal Article
Li Xiang1
TL;DR: This paper points out a drawback of BAN logic analysis in key guessing attacks though proving an authentication protocol with BAN Logic, in which non-formal methods are needed in the analysis together.
Abstract: BAN logic can prove whether a protocol can reach expected target and find some defects in the protocol,which helps the protocol get further improvement.However,this paper points out a drawback of BAN logic analysis in key guessing attacks though proving an authentication protocol with BAN logic.In this case,non-formal methods are needed in the analysis together.

4 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