Cryptanalysis of EC-RAC, a RFID identification protocol

71Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.
Get full text

Abstract

At RFID'08, Lee et al. have proposed a RFID scheme based on elliptic curve cryptography. This scheme, called Elliptic Curve Random Access Control (EC-RAC) has been conceived in order to be implemented on an efficient security processor designed for RFID tags. The aim of this scheme is to enable a fast, secure and private identification scheme. Security arguments are given to prove that RFID tags implementing this scheme are neither traceable nor cloneable. We here show how tags can be tracked if one has eavesdropped the same tag twice and we show that a tag can be impersonated if it has been passively eavesdropped three times. We propose a new scheme based on a modification of the Schnorr scheme as efficient as the initial scheme. We prove that this scheme is zero-knowledge, sound against active adversaries. Moreover, our proposal is private under the Decisional Diffie-Hellman assumption. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Bringer, J., Chabanne, H., & Icart, T. (2008). Cryptanalysis of EC-RAC, a RFID identification protocol. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5339 LNCS, pp. 149–161). https://doi.org/10.1007/978-3-540-89641-8_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free