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
04 Mar 2008
TL;DR: This paper presents a protocol providing securely data packet forwarding with Byzantine robustness, which has low overhead, low processing requirements and can detect misbehavior quickly.
Abstract: Network routers play a key role in modern network communications and are attractive targets to attackers. By mistakenly forwarding, dropping, eavesdropping or modifying packets, malicious routers are great threat to network communications. Most papers emphasize particularly on securing routing protocols. In this paper, we present a protocol providing securely data packet forwarding with Byzantine robustness. The protocol has low overhead, low processing requirements and can detect misbehavior quickly. Through the simulation, our protocol increases throughput by 10% in the presence of 10% malicious nodes, and by 19% in the presence of 20% malicious nodes. Also, due to the authentication method, our protocol is suitable for wireless Ad Hoc networks.

1 citations

Journal Article
TL;DR: A certificateless authentication and key agreement protocol for WSN that does not need for certificate management, and solves the key escrow problem in the identity-based cryptography.
Abstract: It is an important challenge to find out a suitable key establishment protocol for Wireless Sensor Network(WSN) due to limitations of energy,computation capability and storage resources.Many traditional protocols are not suitable.This paper presents a certificateless authentication and key agreement protocol for WSN.The protocol does not need for certificate management,and solves the key escrow problem in the identity-based cryptography.The new protocol achieves kinds of the desired security attributes,and it keeps the nice computational efficiency compared with other protocols.

1 citations

Journal Article
TL;DR: The future research of wireless sensor networks' authentication protocol are explored on the basis of comparing and analyzing the current authentication protocol in wireless Sensor networks, which sums up each protocol's strongpoint and its existing problems.

1 citations

Book ChapterDOI
26 Aug 2007
TL;DR: From comparison and implementation results, it will show that the proposed strong authentication protocol for RFID tag using SHA-1 hash algorithm is a well-designed strong protocol that satisfies various security requirements in RFID system environment.
Abstract: The existing protocol defined in the ISO/IEC 18000-3 standard does not include the cryptographic authentication mechanism To remove security vulnerabilities, this paper proposes a strong authentication protocol for RFID tag using SHA-1 hash algorithm The protocol is based on a three-way challenge response authentication protocol between the tags and a back-end server In addition, three types of the protocol packets are extended for realizing a strong authentication mechanism, which modifies the protocol defined in the ISO/IEC standard In order to verify the proposed scheme, a digital Codec is described in Verilog HDL, and simulated using extended three packets as input vectors The system operates at a clock frequency of 75 MHz on Xilinx FPGA device From comparison and implementation results, we will show that our scheme is a well-designed strong protocol that satisfies various security requirements in RFID system environment

1 citations

Book ChapterDOI
16 Jul 2001
TL;DR: A new method to check authenticity properties of cryptographic protocols, which guarantees that any well-typed protocol is robustly safe, that is, its correspondence assertions are true in the presence of any opponent expressible in spi.
Abstract: We propose a new method to check authenticity properties of cryptographic protocols. First, code up the protocol in the spi-calculus of Abadi and Gordon. Second, specify authenticity properties by annotating the code with correspondence assertions in the style of Woo and Lam. Third, figure out types for the keys, nonces, and messages of the protocol. Fourth, check that the spi-calculus code is well-typed according to a novel type and effect system. Our main theorem guarantees that any well-typed protocol is robustly safe, that is, its correspondence assertions are true in the presence of any opponent expressible in spi. It is feasible to apply this method by hand to several well-known cryptographic protocols. It requires little human effort per protocol, puts no bound on the size of the opponent, and requires no state space enumeration. Moreover, the types for protocol data provide some intuitive explanation of how the protocol works. Our method has led us to the independent rediscovery of flaws in existing protocols and to the design of improved protocols. My talk will describe our method and give some simple examples. Papers describing the method in detail appear elsewhere.

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