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
TL;DR: The results show that the proposed protocol can meet the security requirements of confidentiality, integrity, and traceability in RFID applications and can resist attacks of tracking, eavesdropping, retransmitting and the denial of service.
Abstract: This paper proposes a lightweight mutual authentication protocol for RFID. Based on the simple bit operations, it creates the random number N1 on the tag and the identifier RID on reader to protect the transmission of information, and proves the protocol security at the end. The results show that the proposed protocol can meet the security requirements of confidentiality, integrity, and traceability in RFID applications. Furthermore, the protocol can resist attacks of tracking, eavesdropping, retransmitting and the denial of service, which makes up the security defects mentioned on this paper.
TL;DR: It is shown that the proposed protocol greatly enhance the capability of verifiability, confidentiality and integrality, and corrects the existing Hash-based protocol secure deficiency so that it is more suitable for low-cost RFID systems than those existing ones.
Abstract: This document analyzes the security drawback of the Hash-based algorithm authentication protocols which is frequently used in low-cost RFID systems, and proposes a lightweight mutual authentication protocol. In the proposed protocol, all authenticated information is encrypted , the location privacy is also provided by refreshing an identifier of a tag in each session and lost massages can be recovered from many attacks such as spoofing attacks. The comparison result of the simulation experiment and the formal correctness proof of the proposed authentication protocol is based on BAN logic. It shows that the proposed protocol in this article greatly enhance the capability of verifiability, confidentiality and integrality, it also corrects the existing Hash-based protocol secure deficiency so that it is more suitable for low-cost RFID systems than those existing ones.
01 Aug 2016
TL;DR: A secure and efficient grid pairing-free certificate-less two-party authenticated key agreement protocol is proposed for grid computing and is mathematically proved as secure and efficiency in the Lippold model, a very strong security model, under the gap Diffie-Hellman assumption.
Abstract: Security and efficiency are the main grid authentication protocols objectives. Practical efficient certificate-less public key cryptography-based authentication protocol is widely acknowledged as a challenging issue in grid computing environment. Unfortunately, certificate-less authenticated key agreement protocols rely on bilinear pairing that is extremely computational expensive. A recently published protocol claims meeting some attacks, however, there are some shortcomings in such a protocol. In this paper, such a competing protocol is mathematically criticized. Then, a secure and efficient grid pairing-free certificate-less two-party authenticated key agreement protocol is proposed for grid computing. Finally, the proposed protocol is mathematically proved as secure and efficient in the Lippold model, a very strong security model, under the gap Diffie-Hellman assumption.
09 Jul 2011
TL;DR: The approach presented in this paper allows a designer to define participants who are trustworthy enough to transfer information between other two participants without existence of a direct channel to achieve basic routing functionality.
Abstract: This paper describes one of possible implementations of method used for protocol design described in a paper from 1998 by L. Buttyan, S. Staamann and U. Wilhelm which proposes a backward search (regression) when synthesizing an authentication protocol. Furthermore, the approach presented in this paper allows a designer to define participants who are trustworthy enough to transfer information between other two participants without existence of a direct channel to achieve basic routing functionality.
01 Jan 2014
TL;DR: A secure protocol for spontaneous wireless unexpected networks that uses Associate in Nursing hybrid symmetric asymmetric theme and therefore the trust between users so as to exchange the initial knowledge and the key keys that may be used to cipher the information is presented.
Abstract: This paper presents a secure protocol for spontaneous wireless unexpected networks that uses Associate in Nursing hybrid symmetric asymmetric theme and therefore the trust between users so as to exchange the initial knowledge and to exchange the key keys that may be used to cipher the information. Trust relies on the primary visual contact between users. Our proposal may be a complete self-configured secure protocol that is able to produce the network and share secure services with none infrastructure. The network permits sharing resources and offering new services among users in a very secure setting. The protocol includes all functions required to work with none external support. We've designed and developed it in devices with restricted resources. Network creation stages area unit elaborated and therefore the communication, protocol messages, and network management area unit explained. Our proposal has been enforced so as to check the protocol procedure and performance. Finally, we tend to compare the protocol with alternative spontaneous unexpected network protocols so as to highlight its options and that we offer a security analysis of the system.