A Scalable and Provably Secure Hash-Based RFID Protocol

Avoine, Gildas; Oechslin, Philippe

doi:10.1109/percomw.2005.12

Cited by 236 publications

(169 citation statements)

References 9 publications

Supporting

Mentioning

167

Contrasting

Order By: Relevance

“…In order to prevent this kind of vulnerability, in our protocols we use a group secret key k group , which is shared by all the tags belonging to that group. 3 A more serious weakness concerns the nature of the "proof" P AB generated by the tags: this is not a proof that tag A and tag B were scanned simultaneously while in the presence of an authorized reader. Indeed, one cannot exclude the possibility that P AB was generated while the tags were in the presence of a rogue reader, and that at a later time P AB was replayed by a corrupted tag (impersonating successively tag A and tag B ) in the presence of the authorized reader.…”

Section: 1mentioning

confidence: 99%

Provably Secure Grouping-Proofs for RFID Tags

Burmester

Medeiros

Motta

2008

Smart Card Research and Advanced Applications

102

View full text Add to dashboard Cite

Abstract. We investigate an application of RFIDs referred to in the literature as group scanning, in which several tags are "simultaneously" scanned by a reader device. Our goal is to study the group scanning problem in strong adversarial models. We present a security model for this application and give a formal description of the attending security requirements, focusing on the privacy (anonymity) of the grouped tags, and/ or forward-security properties. Our model is based on the Universal Composability framework and supports re-usability (through modularity of security guarantees). We introduce novel protocols that realize the security models, focusing on efficient solutions based on off-the-shelf components, such as highly optimized pseudo-random function designs that require fewer than 2000 Gate-Equivalents.

show abstract

Section: 1mentioning

confidence: 99%

Provably Secure Grouping-Proofs for RFID Tags

Burmester

Medeiros

Motta

2008

Smart Card Research and Advanced Applications

102

View full text Add to dashboard Cite

show abstract

“…There have been many papers which are hash-based [2,4,3,5,7,9,14,15,17], pseudonym-based [1,12], zero knowledge-based [16] using PUF(Physical Unclonable Function), and tree-based protocol [8] using pseudonym generator that attempts to address the security concerns raised as using RFID tags, but it is believed that there is no perfect protocol that avoids all of the threats with reasonably low cost until now. Hash Lock Scheme [14](denoted by "HLS") is based on one-way hash function; HLS is traceable.…”

Section: Previous Workmentioning

confidence: 99%

A Scalable and Untraceable Authentication Protocol for RFID

Seo

Lee

Kim

2006

Emerging Directions in Embedded and Ubiquitous Computing

View full text Add to dashboard Cite

Abstract. RFID (Radio Frequency Identification) is recently becoming popular, promising and widespread. In contrast, RFID tags can bring about traceability that causes user privacy and reduces scalability of RFID. Guaranteeing untraceability and scalability at the same time is so critical in order to deploy RFID widely since user privacy should be guaranteed. A large number of RFID protocols were designed in the open literature, but any known protocols do not satisfy untraceability and scalability at the same time to the best of our knowledge. In this paper, we suggest a RFID authentication protocol that guarantees untraceability and scalability together; needless to say preventing several known attacks: replay, spoofing, desyncronization, and cloning by eavesdropping. Our protocol supports ownership transfer and considers multitag-reader environment; a reader receives messages from the tags what a reader wants in our protocol. In addition, we address the reason why the item privacy is important, and a way to keep it securely.

show abstract

“…The identification value received by the reader is then searched in the back-end in hash chains associated to each tag in the system. 2 A time-memory trade-off speeding up the back-end computations at the expense of pre-computations was proposed for the original scheme and some of its variants [6].…”

Section: Introductionmentioning

confidence: 99%

Lightweight Privacy Preserving Authentication for RFID Using a Stream Cipher

Billet

Etrog

Gilbert

2010

Fast Software Encryption

View full text Add to dashboard Cite

Abstract. In this paper, a privacy preserving authentication protocol for RFID that relies on a single cryptographic component, a lightweight stream cipher, is constructed. The goal is to provide a more realistic balance between forward privacy and security, resistance against denial of service attacks, and computational efficiency (in tags and readers) than existing protocols. We achieve this goal by solely relying on a stream cipher-which can be arbitrarily chosen, for instance a stream cipher design aimed at extremely lightweight hardware implementations-and we provide security proofs for our new protocol in the standard model, under the assumption that the underlying stream cipher is secure.

show abstract

A Scalable and Provably Secure Hash-Based RFID Protocol

Cited by 236 publications

References 9 publications

Provably Secure Grouping-Proofs for RFID Tags

Provably Secure Grouping-Proofs for RFID Tags

A Scalable and Untraceable Authentication Protocol for RFID

Lightweight Privacy Preserving Authentication for RFID Using a Stream Cipher

Contact Info

Product

Resources

About