Paper 2013/787 Original: eprint.iacr.org/2013/787 ↗
Wide-weak Privacy Preserving RFID Mutual Authentication Protocol
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2013-11-30: last updated
- 2013-11-30: published
- Short URL
- https://ia.cr/2013/787
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2013/787,
author = {Raghuvir Songhela and Manik Lal Das},
title = {Wide-weak Privacy Preserving RFID Mutual Authentication Protocol},
howpublished = {Cryptology {ePrint} Archive, Paper 2013/787},
year = {2013},
url = {https://eprint.iacr.org/2013/787}
}