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 Sep 1995
TL;DR: A novel notion of a fail-stop protocol is proposed, which automatically halts in response to any active attack that interferes with protocol execution, thus reducing protocol security analysis to that of passive attacks only.
Abstract: : We present a methodology to facilitate the design and analysis of secure cryptographic protocols. We advocate the general approach, and a new avenue for research, of restricting protocol designs to well-defined practices, instead of ever increasing the complexity of protocol security analysis mechanisms to deal with every newly discovered attack and the endless variations in protocol construction. In particular, we propose a novel notion of a fail-stop protocol, which automatically halts in response to any active attack that interferes with protocol execution, thus reducing protocol security analysis to that of passive attacks only. We suggest types of protocols that are fail-stop, outline some proof techniques for them, and use examples to illustrate how the notion of a fail-stop protocol can make protocol design easier and can provide a more solid basis for some available protocol analysis methods.

1 citations

Journal Article
TL;DR: This paper researches on quick and efficient formal analysis of security protocol, and presents the concept of trust domain, which analyzes the trust domain of protocol entity directly and makes analysis easier.
Abstract: This paper researches on quick and efficient formal analysis of security protocol,and presents the concept of trust domain.Diagrammatic analysis is adopted,which makes deduction of protocol more clear and intuitive.This method analyzes the trust domain of protocol entity directly,which makes analysis easier.Experimental results show that the method is faster and more intuitive compared with traditional methods.It provides ways and basis for finding redundancies of security protocols.

1 citations

Journal ArticleDOI
01 Nov 2014
TL;DR: A partially distributed authentication scheme is proposed that uses hierarchical network structure, which has some advantages in the overhead of the storage, computing and communication, while network security can be guaranteed.
Abstract: Existing security authentication schemes are mostly concentrated on the key management and cryptographic algorithms. However, there are few authentication schemes designed according to the application needs. To solve this problem, considering the limited resource of wireless sensor networks and the practical application, a partially distributed authentication scheme is proposed. We use hierarchical network structure. Centralized authentication is used between the base station and cluster head nodes, while cluster head node and ordinary nodes use a distributed authentication. Analysis shows that this method has some advantages in the overhead of the storage, computing and communication, while network security can be guaranteed.

1 citations

Proceedings ArticleDOI
01 Dec 2014
TL;DR: An ECC-based mutual authentication and key agreement scheme is proposed to overcome such a security problem and an analysis of it is provided to indicate that compared to Arshad et al.'s scheme, this scheme reduces twice hash operation and is more secure with reasonable computation cost.
Abstract: SIP (Session Initial Protocol) has been a very popular protocol for VoIP. However, the authentication of this protocol just derives from HTTP digest authentication, which has been demonstrated insecure in the open network. Recently, Arshad et al. proposed an improved mutual authentication scheme based on ECC and claimed that it's secure enough. In this paper, however, we point out that their protocol still could not resist offline password guessing attacks. Furthermore, we propose an ECC-based mutual authentication and key agreement scheme to overcome such a security problem. Also, an analysis of it is provided to indicate that compared to Arshad et al.'s scheme, this scheme reduces twice hash operation and is more secure with reasonable computation cost.

1 citations

Proceedings ArticleDOI
04 Nov 2010
TL;DR: A new protocol for roaming based on multi-signature and three-party key agreement is proposed in this paper and the security of the protocol is proved through formal analysis based on the strand space model.
Abstract: After analyzing the merits and shortcomings of some current authentication protocols for roaming in wireless mesh networks (WMNs), we propose a new protocol for roaming based on multi-signature and three-party key agreement in this paper and prove the security of the protocol through formal analysis based on the strand space model. We also show the reliability and performance gain of the protocol using network simulation.

1 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