Yoking Proof Research Articles

An improved low-cost yoking proof protocol based on Kazahaya’s flaws

Peris-Lopez et al. (J Netw Comput Appl 34:833–845, 2011) recently provided some guidelines that should be followed to design a secure yoking proof protocol. In addition, conforming to those guidelines and EPC C1-G2, they presented a yoking proof for medical systems based on low-cost RFID tags, named Kazahaya. In this paper, we compromise its security and show how a passive adversary can retrieve secret parameters of a patient’s tag in cost of $$O(2^{16})$$ off-line PRNG evaluations. Nevertheless, to show other weaknesses of the protocol and rule out any possible improvement by increasing the length of the used PRNG, we present a forgery attack that proves that a generated proof at time $$t_n$$ can be used to forge a valid proof for any desired time $$t_j$$ . The success probability of this attack is ‘1’ and the complexity is negligible. In addition, we present a new lightweight protocol based on 128-bit PRNG function to solve the problems of Kazahaya protocol. In terms of security, we evaluate the new protocol based on formal and informal methods and prove that the improved protocol is not vulnerable to RFID attacks.

Improved yoking proof protocols for preserving anonymity

In emerging RFID applications, the yoking proof provides a method not only to ensure the physical proximity of multiple objects but also to verify that a pair of RFID tags has been scanned simultaneously by a reader. Previous studies have focused on generating the yoking proof, but have not been successful in preserving the anonymity of tags. In this paper, we address two attacks on tracking RFID tags and propose a new yoking proof protocol to improve anonymity of the tags. For better practicality, we also present authenticated yoking proof generation against DoS attacks on the system. Our analysis shows that the proposed protocols achieves improved anonymity effectively. Specifically, the protocols require the least number of computational steps and modules in a tag, while preserving its anonymity.

Privacy-Preserving Yoking Proof with Key Exchange in the Three-Party Setting

Yoking proof is a very useful security primitive that can be used to prove the co-existence of two or multiple entities in an identification protocol. It can be incorporated into radio frequency identification (RFID) protocols and used in many practical applications such as pharmaceutical distribution and manufacturing. However, the existing yoking proofs do not support secure key establishment, which is required in order to allow secure communication between the reader and the RFID tags after the identification process. In this paper, we propose a novel yoking proof with key exchange that allows the reader to establish a secure communication channel with the tags. We define the formal security models for yoking proof with key exchange and prove that the proposed protocol can achieve yoking proof soundness, session key security and tag identity privacy.

A High-security RFID Grouping Proof Protocol

Several categories of RFID authentication protocols have been proposed recently, among which Jules [5] introduced a novel research direction, named yoking proof. It is used to solve the problem that two tags have to be scanned simultaneously for some reasons. Afterwards, the yoking proof was developed into the grouping proof protocol and many such protocols have been presented. However there are some flaws on security or computational overhead. Based on the existing grouping proof protocols, a new method on key distribution is developed in this paper by means of distributing the points on straight lines to the entities. With this method, the performance of the grouping proof protocol will be improved. In comparison with the previous protocols, it provides security enhancement and performance improvement, which balances security and computational overhead to some extent.

Comments on enhanced yoking proof protocols for radio frequency identification tags and tag groups

A radio frequency identification (RFID) yoking proof scheme can generate proofs of simultaneous presence of two tags in the range of a specified reader so that an off-line verifier can verify the proofs later. This proof has found several interesting applications. However, many existing RFID yoking schemes are vulnerable to replay attacks. To overcome the weaknesses, Cho et al. proposed a new RFID yoking proof protocol and a new grouping protocol. Unfortunately, Cho et al.’s schemes are still vulnerable to replay attacks. In this paper, in addition to demonstrating weaknesses, we further discuss the rationale behind these weaknesses to provide a guide line for designing secure RFID yoking schemes. Based on the guide line, we propose a new RFID yoking scheme and a new RFID grouping scheme. Performance evaluation shows that our scheme outperforms its counterparts.

Using RFID Yoking Proof Protocol to Enhance Inpatient Medication Safety

The low birth rate has led to an aging society; the burgeoning number of elderly patients may affect the medical quality and result in negative medical incidents. There are many factors that lead to medical errors, such as similar medication names, erroneous labels and packaging, as well as staff shortages, fatigue and carelessness. Determining how to reduce medical errors has become an important issue. As RFID exhibits powerful identification characteristics, it can help nurses to quickly identify patients and their corresponding medicine. Currently, there are numerous practical applications for improving the efficiency of Radio Frequency Identification (RFID) systems. In this paper, we use an RFID yoking proof mechanism which conforms to EPCglobal Class 1 Generation 2 standards to improve patient safety and reduce medical errors. Our scheme can achieve different goals such as resist numerous known attacks, achieve mutual authentication, anonymity and non-repudiation. It also provides a practical medical care and offer higher quality of medical care. The pharmacist cannot deny that this prescription was confirmed for the patient and the nurse cannot also deny he or she dispensed this medicine to the patient for protecting the patients' interests.

Select-response grouping proof and its verification protocol for RFID tags

In this paper, we investigate an application scenario in which the user requires a proof that a group of radio frequency identification (RFID) tags are scanned simultaneously by reading devices. Such a proof is generally called a grouping proof. After examining the existing 'yoking proof' grouping protocols used for RFIDs, an improved protocol called the 'select-response' grouping proof is proposed. Instead of passively awaiting the responses from RFID tags as used in existing protocols, the proposed protocol uses a new mechanism whereby the reader/verifier actively sends commands to each tag, asking for a response and then generating the grouping proof. After this fundamental change, the verification process is simple and flexible. In addition, the proposed protocol can perform multi-group verification and it also possesses collision-free, missing tag identification, and reading order independent properties. Moreover, the proposed protocol protects the mutual authentication from clandestine scanning and replay attacks, and hence, the overall security is improved.

An RFID grouping proof protocol exploiting anti-collision algorithm for subgroup dividing

Verifying that several RFID tags are all present in a group poses specific challenges that have generated great interest in the academic community. As the number of tags becomes large, the unreliability of radio wave communication could potentially cause possible high failure rates to the existing grouping proof. In this paper, we propose a way of grouping proof, which uses the dynamic binary tree anti-collision algorithm to subgroup the tags. This paper combines the 'Yoking Proof' idea and the 'Select-Response' mode from previous publications. The 'Yoking Proof' is generated between subgroups and within each subgroup, and as a result, the failure rates are greatly reduced. The 'Select-Response' mode is used for subgroup verification.