Radio frequency identification (RFID) is a wireless technology for automatic identification and data capture. Security and privacy issues in the RFID systems have attracted much attention. Many approaches have been proposed to achieve the security and privacy goals. One of these approaches is RFID authentication protocols by which a server and tags can authorize each other through an intracity process. Recently, Chou proposed a RFID authentication protocol based on elliptic curve cryptography. However, this paper demonstrates that the Chou's protocol does not satisfy tag privacy, forward privacy and authentication, and server authentication. Based on these security and privacy problems, we also show that Chou's protocol is defenseless to impersonation attacks, tag cloning attacks and location tracking attacks. Therefore, we propose a more secure and efficient scheme, which does not only cover all the security flaws and weaknesses of related previous protocols, but also provides more functionality. We prove the security of the proposed improved protocol in the random oracle model.

Cryptanalysis and improvement of an efficient mutual authentication RFID scheme based on elliptic curve cryptography

To enhance the quality of healthcare in the management of chronic disease, telecare medical information systems have increasingly been used. Very recently, Zhang and Qi (J. Med. Syst. 38(5):47, 32), and Zhao (J. Med. Syst. 38(5):46, 33) separately proposed two authentication schemes for telecare medical information systems using radio frequency identification (RFID) technology. They claimed that their protocols achieve all security requirements including forward secrecy. However, this paper demonstrates that both Zhang and Qi's scheme, and Zhao's scheme could not provide forward secrecy. To augment the security, we propose an efficient RFID authentication scheme using elliptic curves for healthcare environments. The proposed RFID scheme is secure under common random oracle model.

A Provably Secure RFID Authentication Protocol Based on Elliptic Curve for Healthcare Environments

With the fast development of the Internet of Things, Radio Frequency Identification (RFID) has been widely applied into many areas. Nevertheless, security problems of the RFID technology are also gradually exposed, when it provides life convenience. In particular, the appearance of a large number of fake and counterfeit goods has caused massive loss for both producers and customers, for which the clone tag is a serious security threat. If attackers acquire the complete information of a tag, they can then obtain the unique identifier of the tag by some technological means. In general, because there is no extra identifier of a tag, it is difficult to distinguish an original tag and its clone one. Once the legal tag data is obtained, attackers can be able to clone this tag. Therefore, this paper shows an efficient RFID mutual verification protocol. This protocol is based on the Physical Unclonable Function (PUF) and the lightweight cryptography to achieve efficient verification of a single tag. The protocol includes three process: tag recognition, mutual verification and update. The tag recognition is that the reader recognizes the tag; mutual verification is that the reader and tag mutually verify the authenticity of each other; update is supposed to maintain the latest secret key for the following verification. Analysis results show that this protocol has a good balance between performance and security.

https://www.mdpi.com/1424-8220/18/3/760/pdf

A Lightweight RFID Mutual Authentication Protocol Based on Physical Unclonable Function

Radio frequency identification (RFID) is widely used in several contexts, such as logistics, supply chains, asset tracking, and health, among others, therefore drawing the attention of many researchers. This paper presents a review of the most cited topics regarding RFID focused on applications, security, and privacy. A total of 62,685 records were downloaded from the Web of Science (WoS) and Scopus core databases and processed, reconciling the datasets to remove duplicates, resulting in 40,677 unique elements. Fundamental indicators were extracted and are presented, such as the citation number, average growth rate, and average number of documents per year. We extracted the top topics and reviewed the relevant indicators using a free Python tool, ScientoPy. The results are discussed in the following sections: the first is the Applications Section, whose subsections are the Internet of Things (IoT), Supply Chain Management, Localization, Traceability, Logistics, Ubiquitous Computing, Healthcare, and Access Control; the second is the Security and Privacy section, whose subsections are Authentication, Privacy, and Ownership Transfer; finally, we present the Discussion section. This paper intends to provide the reader with a global view of the current status of trending RFID topics and present different analyses from different perspectives depending on motivations or background.

https://www.mdpi.com/2079-3197/9/6/69/pdf

RFID Applications and Security Review

The rapid development of IoT technology has led to the usage of various devices in our daily life. Along with the ever-increasing rise of the Internet of Things, the use of appropriate methods for establishing secure communications in health care systems is vital. The adoption of high-security optimal mechanisms for this purpose has been more effective regarding the efficiency of medical information systems; hence, many studies are being conducted in this field today. One of the most important components is the RFID cards that can be used for communication between entities in the environment. In healthcare systems, patient information is critical and nobody should have access to this information. Thus, providing security for these networks is essential. Recently, good researches have been done in the area of authentication for medical information systems, using RFID technology, which has a low computational cost. In this paper, we propose a novel method based on elliptic curve cryptography for vital and efficient and scalable authentication between RFID cards, card readers, and servers. This proposed method maintains security and has less computational cost and low elliptic curve point multiplication running time compared to similar recent methods.

/pdf/scalable-efficient-and-secure-rfid-with-elliptic-curve-3vho77u6hb.pdf

Scalable, efficient, and secure RFID with elliptic curve cryptosystem for Internet of Things in healthcare environment

Radio frequency identification (RFID) is a popular kind of automatic identification technologies that uses radio frequencies. Many security and privacy problems my be raised in the using of RFID due to its radio transmission nature. In 2012, Cho et al. (Comput Math Appl, 2012. doi: 10.1016/j.camwa.2012.02.025 ) proposed a new hash-based RFID mutual authentication protocol to solve these problems. However, this protocol was demonstrated to be vulnerable to DOS attack. This paper further shows that Cho et al.'s protocol is vulnerable to traffic analysis and tag/reader impersonation attacks. An improved protocol is also proposed which can prevent the said attacks.

Improvement of the Hash-Based RFID Mutual Authentication Protocol

In some practical applications of secret sharing schemes, such as Byzantine Quorum systems and secure multi-party protocols, the adversary can corrupt subsets of participants at the same time and exploits their shares to recover the secret. In these applications, the system can be described directly by corruptible subsets of participants (so-called adversary structure). A secret sharing scheme realizing adversary structure is a tool for these applications. It is a method of sharing a secret among a finite set of participants in such a way that only certain pre-specified subsets of participants cannot recover the secret. In this paper, we propose a verifiable multi-secret sharing scheme based on one-way hash function that realizes adversary structure, in which each participant has only one reusable shadow. In this scheme, the participant set and the adversary structure can be changed without refreshing any participant's secret shadow and new secrets can be shared. The security of the proposed scheme is based on the properties of the one-way hash function. Our scheme has the advantages of better verifiability and fewer shadows preserves by every participant respect to other schemes realizing adversary structures.

A New Verifiable Multi-secret Sharing Scheme Realizing Adversary Structure

In this paper, we introduce the (G-$psi$) contraction in a metric space by using a graph. Let $F,T$ be two multivalued mappings on $X.$ Among other things, we obtain a common fixed point of the mappings $F,T$ in the metric space $X$ endowed with a graph $G.$

https://ijnaa.semnan.ac.ir/article_309_2b668c7b7359b2f90973027b71b332c3.pdf

Common fixed point of multivalued graph contraction in metric spaces

Ultra lightweight Radio Frequency Identification (RFID) authentication protocols are suitable for low*cost RFID tags with restricted computational power and memory space. Recently, Lee proposed two ultra lightweight authentication protocols for low*cost RFID tags, namely DIDRFID an d SIDRFID protocols. The first protocol is based on dynamic identity and the second one on static identity. Lee claimed that his protocols can resist tracking, replay, impersonation and DOS attacks. In this paper, we show that Lee's protocols are not secure and they are vulnerable against tracking, impersonation, and full disclosure attacks. Specially, an adversary can accomplish an effective full disclosure attack on DIDRFID protocol by eavesdropping two consecutive sessions and gets all the secret information stored on a tag. Also, we demonstrate that an adversary with ability of obtaining secret information of a single compromised tag in SIDRFID protocol, can get the secret information of other tags and she/he can completely control the whole RFID system.

Vulnerability Analysis of Two Ultra lightweight RFID Authentication Protocols

In this paper, we introduce the (G-$psi$) contraction in a metric space by using a graph. Let $T$ be a multivalued mappings on $X.$ Among other things, we obtain a fixed point of the mapping $T$ in the metric space $X$ endowed with a graph $G$ such that the set of vertices of $G,$ $V(G)=X$ and the set of edges of $G,$ $E(G)subseteq Xtimes X.$

https://ijnaa.semnan.ac.ir/article_4922_759ff14442b0c3e3c892afa301fe507a.pdf

Masoud Hadian Dehkordi

Papers

Improvement of the Hash-Based RFID Mutual Authentication Protocol

A New Verifiable Multi-secret Sharing Scheme Realizing Adversary Structure

Common fixed point of multivalued graph contraction in metric spaces

Vulnerability Analysis of Two Ultra lightweight RFID Authentication Protocols

Fixed point of set-valued graph contractions in metric spaces