Showing papers on "Otway–Rees protocol published in 1988"
01 May 1988
TL;DR: The author surveys a collection of protocols in which the level of security or authentication required by the system is actually attained, not because of a failure of the cryptoalgorithm used, but rather because of shortcomings in the design of the protocol.
Abstract: When a cryptoalgorithm is used to solve data security or authentication problems, it is implemented within the context of a protocol that specifies the appropriate procedures for data handling. The purpose of the protocol is to ensure that when the cryptosystem is applied, the level of security or authentication required by the system is actually attained. The author surveys a collection of protocols in which this goal has not been met, not because of a failure of the cryptoalgorithm used, but rather because of shortcomings in the design of the protocol. Guidelines for the development of sound protocols are extracted from an analysis of these failures. >
136 citations
01 Apr 1988
TL;DR: In this paper, a Fiat-Shamir like authentication protocol for the El-Gamal Scheme is presented and it is shown that this protocol can be used for e.g. solving the challenge of verifying the identity of an authenticated party.
Abstract: In this paper we present a Fiat-Shamir like authentication protocol for the El-Gamal Scheme.
106 citations
10 Oct 1988
TL;DR: A performance analysis of this protocol shows that it commits with high probability under realistic operating conditions without invoking termination protocol if N is sufficiently large.
Abstract: A novel general protocol for atomic broadcast in networks is presented. The protocol tolerates loss, duplication, reordering, delay of messages, and network partitioning in an arbitrary network of 'fail-stop' sites (i.e. no Byzantine site behavior is tolerated). The protocol is fully decentralized and is based on majority-consensus decisions to commit on unique ordering of received broadcast messages. Under normal operating conditions, the protocol requires three phases to complete and approximately 4N messages where N is the number of sites. If more than 4N broadcast messages are exchanged in each protocol execution, this protocol achieves better performance than any of the protocols published to date without assuming specific types of site connectivity, clock synchronization, or knowledge of failed sites and failed communication links. Under abnormal operating conditions, a decentralized termination protocol, also presented, is invoked. A performance analysis of this protocol shows that it commits with high probability under realistic operating conditions without invoking termination protocol if N is sufficiently large. >
41 citations
01 Apr 1988
TL;DR: A protocol for interactive data exchange which provides strong mutual authentication of the users and data integrity and is robust to data/protocol errors and active attacks is described.
Abstract: In this paper, we have described a protocol for interactive data exchange which provides strong mutual authentication of the users and data integrity. The protocols used are based on a cryptographic system using discrete exponentiation for public key exchange and conventional data exchange. The protocol is robust to data/protocol errors and active attacks. While it has been shown as an interactive protocol, a one-way data exchange protocol (for email or file transfer) can easily be derived from this protocol.
14 citations
27 Mar 1988
TL;DR: A Petri-net model of the Protocol is presented to verify that the protocol is correct and deadlock-free and a authentication protocol with security imbedded into it is reported.
Abstract: A authentication protocol with security imbedded into it is reported. It is based on a combination of the private-key and the public-key encryption systems. A Petri-net model of the protocol is presented to verify that the protocol is correct and deadlock-free. >
7 citations