Paper Info
Title
Solving the Simultaneous Scanning Problem Anonymously: Clumping Proofs for RFID Tags
Abstract
The vast majority of works on RFID security focus only on privacy and tracking (violation of location privacy). However, in this paper we are interested in a new mechanism that enables a pair of RFID tags to generate a proof of having been simultaneously scanned by a reading device. In 2004, Juels introduced this concept and presented a proof named "yooking proof. Saito and Sakurai (2005) showed how Juels's proof was vulnerable to replay attacks, and proposed a new scheme based on using timestamps. Neverth less, Piramuthu later demonstrated that this new proof was also vulnerable to replay atacks. Although Piramthu'sproposed scheme seems to be resistant to replay attacks, and attack using multi-proofs sessions can be attained. Furthermore, Piramuthu claims that privacy and location privacy is guaranteed in his scheme, which is not the case as tags transmit their static identifiers in clear. A new anon mous proof, named "clumping proof'", is proposed here that solves the multi-proofs session attack and provides privacy while also protecting against tracking.
Year
DOI
Venue
2007
10.1109/SECPERU.2007.12
International Workshop on Security
Keywords
Field
DocType
data privacy,replay attacks,clumping proofs,rfid security,privacy,radiofrequency identification,simultaneous scanning problem anonymously,rfid tag,location privacy violation,multi-proofs session attack,protocols,security,rfid tags,ubiquitous computing,history,frequency,indexing terms
Internet privacy,Identifier,Computer security,Computer science,Mathematical proof,Timestamp,Information privacy,Replay attack,Privacy software
Conference
ISBN
Citations 
PageRank 
0-7695-2863-5
26
1.28
References 
Authors
13
5
Name
Order
Citations
PageRank
Pedro Peris-Lopez1107661.84
Julio C. Hernandez-Castro229826.88
Juan M. Estevez-Tapiador359433.45
Arturo Ribagorda466950.25
III Carlos Arturo Ribagorda5261.28