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 Article
TL;DR: This paper would like to present a universal encrypted deniable authentication protocol from any public key encryption scheme that is secure and can be directly derived from the Aumann and Rabin protocol.
Abstract: The notion of deniable authentication protocol was introduced in 1998 by Dwork et al. [11] and Aumann and Rabin [1, 2] independently. As a new cryptographic authentication protocol, a deniable authentication protocol enables an intended receiver to identify the source of a given message without being able to prove the identity of the sender to a third party. Over the past years, many deniable authentication protocols have been proposed. In this paper, we would like to present a universal encrypted deniable authentication protocol from any public key encryption scheme. Provided that the public key encryption scheme is secure, a secure deniable authentication protocol can be directly derived.

7 citations

Journal ArticleDOI
TL;DR: It is explicitly showed that the ping-pong protocol has a high degree of security against a class of individual attacks, and successfully resolves the famous Wojcik attack.
Abstract: A scheme for deterministic secure direct communication based on ping-pong protocol without restricting the security control only to a distinct control mode and debate via classical channel is proposed. It utilizes an entangled pair of qubits and presents a higher bit-rate transfer of information together with a higher security than ping-pong protocol. The security of protocol is enhanced by introducing a control factor for each message mode. It is explicitly showed that the protocol has a high degree of security against a class of individual attacks, and successfully resolves the famous Wojcik attack.

7 citations

Proceedings ArticleDOI
07 Apr 2008
TL;DR: This paper presents a two-factor authentication protocol and followed by a key establishment mechanism using only hash function and analyzes and verify the security of the proposed protocol using non-monotonic logic.
Abstract: Authentication is one of the important security properties required to identify the communicating party or to validate the received document. Several authentication techniques with many flavors have been proposed, however, most of them lack a formal security proof. In this paper, we present a two-factor authentication protocol and followed by a key establishment mechanism using only hash function. We analyze and verify the security of the proposed protocol using non-monotonic logic.

7 citations

Journal ArticleDOI
Keun-Ho Lee1, Sang-Bum Han1, Heyi-Sook Suh1, SangKeun Lee1, Chong-Sun Hwang1 
TL;DR: This work provides scalable, threshold authentication scheme in ad hoc networks that uses certificates containing an asymmetric key and a multilayer architecture so that the CCH is achieved using the threshold scheme, thereby reducing the computational overhead and successfully defeating all identified attacks.
Abstract: In this paper, we describe a secure cluster-routing protocol based on a multilayer scheme in ad hoc networks. This work provides scalable, threshold authentication scheme in ad hoc networks. We present detailed security threats against ad hoc routing protocols, specifically examining cluster-based routing. Our proposed protocol, called "authentication based on multilayer clustering for ad hoc networks" (AMCAN), designs an end-to-end authentication protocol that relies on mutual trust between nodes in other clusters. The AMCAN strategy takes advantage of a multilayer architecture that is designed for an authentication protocol in a cluster head (CH) using a new concept of control cluster head (CCH) scheme. We propose an authentication protocol that uses certificates containing an asymmetric key and a multilayer architecture so that the CCH is achieved using the threshold scheme, thereby reducing the computational overhead and successfully defeating all identified attacks. We also use a more extensive area, such as a CCH, using an identification protocol to build a highly secure, highly available authentication service, which forms the core of our security framework.

7 citations

Journal ArticleDOI
TL;DR: This work implemented a prototype using the proposed mutual authentication protocol for quick response code, a type of two-dimensional barcode that can be photographed and quickly decoded by smartphones and demonstrated how the prototype improves usability in a mobile communication system.
Abstract: User authentication over the Internet has long been an issue for Internet service providers and users. A good authentication protocol must provide high security and mutual authentication on both sides. In addition, it must balance security and usability, which has been shown in the literature to be a difficult problem. To solve this problem, we propose a novel mutual authentication protocol with high security and usability. The proposed protocol was developed for quick response code, a type of two-dimensional barcode that can be photographed and quickly decoded by smartphones. We implemented a prototype using the proposed mutual authentication protocol and demonstrated how the prototype improves usability in a mobile communication system. We also used the Gong---Needham---Yahalom logic with several well-known attack models to analyze the security of the proposed protocol, and we obtained satisfactory results. We expect that using the proposed protocol, Internet service providers will be able to provide a mutual authentication mechanism with high security and usability.

7 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