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 published on a yearly basis
Papers
More filters
04 Apr 2005
TL;DR: This work first considers RTT-based and power-based approaches and couple them to design an effective neighbor verification protocol (NVP), which significantly limits the effectiveness of replay-based attacks by restricting the range where they might be launched and thus makes them practically impossible.
Abstract: Verifying physical presence of a neighbor in wireless ad hoc networks is one of the key components in developing protocols resilient to replay-based attacks. For this, we first consider RTT-based and power-based approaches. We then couple them to design an effective neighbor verification protocol (NVP). In theory, we always see some room for replay-based attacks. However, our proposed protocol significantly limits the effectiveness of replay-based attacks by restricting the range where they might be launched and thus makes them practically impossible.
36 citations
01 Apr 1993
TL;DR: It is the purpose of this document, Security Protocols for SNMPv2, to define one such authentication and one such privacy protocol.
Abstract: It is the purpose of this document, Security Protocols for SNMPv2, to
define one such authentication and one such privacy protocol
[STANDARDS-TRACK]
36 citations
TL;DR: It is claimed that using a uncertified key prudently can give performance advantages and not necessarily reduces the security of authentication protocols, as long as the validity of the key can be verified at the end of an authentication process.
Abstract: Most authentication protocols for distributed systems achieve identification and key distributions on the belief that the use of a uncertified key, i.e. the key whose freshness and authenticity cannot be immediately verified by its receiving principal while being received, should be avoided during the mid-way of an authentication process. In this paper we claim that using a uncertified key prudently can give performance advantages and not necessarily reduces the security of authentication protocols, as long as the validity of the key can be verified at the end of an authentication process. A nonce-based authentication protocol using uncertified keys is proposed. Its total number of messages is shown to be the minimal of all authentication protocols with the same formalized goals of authentication. The properties which make the protocol optimal in terms of message complexity are elaborated, and a formal logical analysis to the protocol is performed. The protocol is extended to counter the session key compromise problem and to support repeated authentication, in a more secure and flexible way without losing its optimality.
36 citations
TL;DR: It is shown that the proposed mutual authentication protocol fails short of its security objectives, and in fact offers the same security level than the EPC standard it tried to correct, and a new EPC-friendly protocol, named Azumi, which may be considered a significant step toward the security of Gen-2 compliant tags.
36 citations
01 Mar 2005
TL;DR: The threats to protocols used to carry authentication for network access will be used as additional input to the Protocol for Carrying Authentication for Network Access (PANA) Working Group for designing the IP based network access authentication protocol.
Abstract: This document discusses the threats to protocols used to carry
authentication for network access. The security requirements arising
from these threats will be used as additional input to the Protocol
for Carrying Authentication for Network Access (PANA) Working Group
for designing the IP based network access authentication protocol.
This memo provides information for the Internet community.
36 citations