Cryptology ePrint Archive: Report 2013/787
Wide-weak Privacy Preserving RFID Mutual Authentication Protocol
Raghuvir Songhela and Manik Lal Das
Abstract: Radio Frequency IDentification (RFID) systems are gaining enormous
interests at 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 RFID system because of pervasiveness of RFID tags. Over the years, many protocols have been proposed for RFID tags' identification using different cryptographic primitives. It has been observed that most of them provide tags' identification, but they fail to preserve tags' privacy. It has been also proven that public-key primitives are essential for strong privacy and security
requirements in RFID systems. In this paper, we present a mutual authentication protocol for RFID systems using elliptic curves arithmetic.
Precisely, the proposed protocol provides narrow-strong and wide-weak
privacy and resists tracking attacks under standard complexity assumption. The protocol is compared with related works and found efficient in comparison to others.
Category / Keywords: cryptographic protocols / elliptic curve cryptosystem, identification protocols, public-key cryptography, RFID
Date: received 25 Nov 2013
Contact author: songhela_raghuvir at daiict ac in
Available format(s): PDF | BibTeX Citation
Version: 20131130:042230 (All versions of this report)
Short URL: ia.cr/2013/787
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]