Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Universal hashing and authentication codes
Designs, Codes and Cryptography
The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
RFID Privacy: An Overview of Problems and Proposed Solutions
IEEE Security and Privacy
Universally composable and forward-secure RFID authentication and authenticated key exchange
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Mutual authentication in RFID: security and privacy
Proceedings of the 2008 ACM symposium on Information, computer and communications security
An efficient forward private RFID protocol
Proceedings of the 16th ACM conference on Computer and communications security
Revisiting DoS Attacks and Privacy in RFID-Enabled Networks
Algorithmic Aspects of Wireless Sensor Networks
Authenticated key exchange secure against dictionary attacks
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
RFID security: tradeoffs between security and efficiency
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Lightweight privacy preserving authentication for RFID using a stream cipher
FSE'10 Proceedings of the 17th international conference on Fast software encryption
A new framework for RFID privacy
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
| Hi-index | 0.00 |
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.