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.

A Secure RFID Multi-Tag Search Protocol Without On-line Server

Abstract: In many applications a reader needs to determine whether a particular tag exists within a group of tags without a server. This is referred to as serverless RFID tag searching. A few protocols for the serverless RFID searching are proposed but they are the single tag search protocol which can search a tag at one time. In this paper, we propose a multi-tag search protocol based on a hash function and a random number generator which can search some tags at one time. For this study, we introduce a protocol which can resolve the problem of synchronization of seeds when communication error occurs in the S3PR protocol[1], and propose a multi-tag search protocol which can reduce the communication overhead. The proposed protocol is secure against tracking attack, impersonation attack, replay attack and denial-of-service attack. This study will be the basis of research for multi-tag serach protocol.

Anonymous Authentication Protocol in Mobile Ad hoc Networks

Abstract: A new anonymous authentication protocol is proposed For Mobile Ad Hoc Networks, the main purpose is to provide the true identity of a hidden node communication mechanism and to improve resilience against malicious attacks. The end-to-end anonymous authentication is conducted in three-pass handshake based on an asymmetric and symmetric key cryptography. After successfully finished authentication phase secure and multiple anonymous data channels are established. The anonymity is guarantied by randomly chosen pseudonyms owned by a user. Nodes of the network are publicly identified and are independent of users' pseudonyms. The article described a network model of the process of implementation of the protocol, and its security is analyzed in brief.

Research and Simulation on RFID Authentication Protocol

Abstract: To resolve the security problem existed in the application of RFID,this paper discussed the advantage and deficiency of the current RFID authentication protocol,then analyzed a new hash-based and isochronous RFID authenti-cation protocol,and presented the simulation of the protocol under the Linux operating system with kernel of 24As a result of the simulation and analysis about the hash-based and isochronous RFID authentication protocol,the protocol achieves privacy protection and anti-clone,and the executive efficiency is improved

A Secure Group-Based AKA Protocol for Machine-Type Communications

Abstract: The fifth generation wireless system 5G is expected to handle with an unpredictable number of heterogeneous connected devices while guaranteeing a high level of security. This paper advances a group-based Authentication and Key Agreement AKA protocol that contributes to reduce latency and bandwidth consumption, and scales upi¾?to a very large number of devices. A central feature of the proposed protocol is that it provides a way to dynamically customize the trade-off between security and efficiency. The protocol is lightweight as it resorts on symmetric key encryption only, hence it supports low-end devices and can be already adopted in current standards with little effort. Using ProVerif, we prove that the protocol meets mutual authentication, key confidentiality, and device privacy also in presence of corrupted devices, a threat model not being addressed in the state-of-the-art group-based AKA proposals. We evaluate the protocol performances in terms of latency and bandwidth consumption, and obtain promising results.

Distributed Secure Clustering Protocol in Wireless Sensor Networks

Abstract: The cluster-based hierarchical topology control has been widely studied and applied in wireless sensor networks. But because of the open nature and limited resource of the sensor network, clustering protocols are vulnerable to the misuse and disruption attacks from the adversaries. As a result, the security of the clustering protocols is a basic requirement for its wide application. A distributed secure clustering protocol is proposed, in which the secure network initialization, random number broadcast from the base station and one-way hash chain are used to achieve the resiliency against possible attacks including node personating, cluster-head occupying, malicious cluster-member recruiting and multiple cluster-membership attacks. The security and cost of the protocol are evaluated and the results show the resiliency and efficiency of the proposed protocol.