Yet another strong privacy-preserving rfid mutual authentication protocol

Abstract

Radio Frequency IDentification (RFID) systems are gaining enormous interests in industry due to their vast applications such as supply chain, access control, inventory, transport, health care and home appliances. Although tag identification is the primary security goal of an RFID system, privacy issue is equally, even more important concern in the RFID system because of pervasiveness of RFID tags. Over the years, many protocols have been proposed for RFID tags’ identification using symmetric key cryptography and other primitives. Many of them have failed to preserve tags’ privacy. In order to achieve privacy and to provide scalability and anti-cloning features of RFID system, public-key primitives should be used in an RFID authentication protocol [1]. In this paper, we present a mutual authentication protocol for RFID systems using elliptic curves arithmetic. The proposed protocol provides narrowstrong and wide-weak privacy under standard complexity assumption.