In this paper we propose an efficient forward-private RFID mutual authentication protocol. The protocol is secure under standard assumptions. It builds over a recent work, extends it to achieve mutual authentication, and improves it by introducing a resynchronization mechanism between tag and reader, through which the server-side computation from O(N ω) is reduced to O(N+ω), where N is the total number of tags in the system, and ω is the maximum number of authentications each single tag can afford during its lifetime. Moreover, the protocol enables the server to control how many times a tag has been read by legitimate and fake readers. © 2011 IFIP International Federation for Information Processing.
CITATION STYLE
D’Arco, P. (2011). An almost-optimal forward-private RFID mutual authentication protocol with tag control. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6633 LNCS, pp. 69–84). https://doi.org/10.1007/978-3-642-21040-2_5
Mendeley helps you to discover research relevant for your work.