Skip to main content
Other
Cryptanalysis of Two Lightweight RFID Authentication Schemes
Computer Science Department Faculty Publication Series
  • Benessa Defend, University of Massachusetts - Amherst
  • Kevin Fu, University of Massachusetts - Amherst
  • Ari Juels
Publication Date
2007
Abstract

Vajda and Buttyan proposed several lightweight authentication protocols for authenticating RFID tags to readers, and left open the quantifiable cryptographic strength. Our cryptanalysis answers this open question by implementing and measuring attacks against their XOR and SUBSET protocols. A passive eavesdropper can impersonate a tag in the XOR protocol after observing only 70 challenge-response transactions between the tag and reader. In contrast, the theoretical maximum strength of the XOR protocol could have required 16! * 2 observed transactions to break the key. Our experiments also show that a passive eavesdropper can recover the shared secret used in the XOR protocol by observing an expected 1,092 transactions. Additionally, a nearly optimal active attack against the SUBSET protocol extracts almost one bit of information for each bit emitted by the tag

Disciplines
Comments

This paper was harvested from CiteSeer

DOI
https://doi.org/10.1109/PERCOMW.2007.34
Citation Information
Benessa Defend, Kevin Fu and Ari Juels. "Cryptanalysis of Two Lightweight RFID Authentication Schemes" (2007)
Available at: http://works.bepress.com/kevin_fu/2/