Entity authentication and key distribution
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
SECTOR: secure tracking of node encounters in multi-hop wireless networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
The faithfulness of abstract protocol analysis: message authentication
Journal of Computer Security - Special issue on ACM conference on computer and communications security, 2001
An RFID Distance Bounding Protocol
SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
Detecting relay attacks with timing-based protocols
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Protocols for RFID tag/reader authentication
Decision Support Systems
Coupon Recalculation for the GPS Authentication Scheme
CARDIS '08 Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Wireless Communications & Mobile Computing
Distance bounding in noisy environments
ESAS'07 Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks
Secure EPC Gen2 Compliant Radio Frequency Identification
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
RFID Distance Bounding Multistate Enhancement
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Optimal security limits of RFID distance bounding protocols
RFIDSec'10 Proceedings of the 6th international conference on Radio frequency identification: security and privacy issues
The Poulidor distance-bounding protocol
RFIDSec'10 Proceedings of the 6th international conference on Radio frequency identification: security and privacy issues
Lightweight RFID authentication with forward and backward security
ACM Transactions on Information and System Security (TISSEC)
Non-uniform stepping approach to RFID distance bounding problem
DPM'10/SETOP'10 Proceedings of the 5th international Workshop on data privacy management, and 3rd international conference on Autonomous spontaneous security
A note on a privacy-preserving distance-bounding protocol
ICICS'11 Proceedings of the 13th international conference on Information and communications security
A secure distance-based RFID identification protocol with an off-line back-end database
Personal and Ubiquitous Computing
A novel RFID distance bounding protocol based on physically unclonable functions
RFIDSec'11 Proceedings of the 7th international conference on RFID Security and Privacy
Security analysis of two distance-bounding protocols
RFIDSec'11 Proceedings of the 7th international conference on RFID Security and Privacy
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Threshold-Based Location-Aware Access Control
International Journal of Handheld Computing Research
Subtle kinks in distance-bounding: an analysis of prominent protocols
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Terrorism in distance bounding: modeling terrorist-fraud resistance
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
Relay attacks are one of the most challenging threats RFID will have to face in the close future. They consist in making the verifier believe that the prover is in its close vicinity by surreptitiously forwarding the signal between the verifier and an out-of-field prover. Distance bounding protocols represent a promising way to thwart relay attacks, by measuring the round trip time of short authenticated messages. Several such protocols have been designed during the last years but none of them combine all the features one may expect in a RFID system. We introduce in this paper the first solution that compounds in a single protocol all these desirable features. We prove, with respect to the previous protocols, that our proposal is the best one in terms of security, privacy, tag computational overhead, and fault tolerance. We also point out a weakness in Tu and Piramuthu's protocol, which was considered up to now as one of the most efficient distance bounding protocol.