EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Special Uses and Sbuses of the Fiat-Shamir Passport Protocol
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Identification Tokens - or: Solving the Chess Grandmaster Problem
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference 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
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
Distance bounding in noisy environments
ESAS'07 Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks
SP 800-98. Guidelines for Securing Radio Frequency Identification (RFID) Systems
SP 800-98. Guidelines for Securing Radio Frequency Identification (RFID) Systems
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
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 framework for analyzing RFID distance bounding protocols
Journal of Computer Security - 2010 Workshop on RFID Security (RFIDSec'10 Asia)
A formal approach to distance-bounding RFID protocols
ISC'11 Proceedings of the 14th international conference on Information security
A secure distance-based RFID identification protocol with an off-line back-end database
Personal and Ubiquitous Computing
Security analysis of two distance-bounding protocols
RFIDSec'11 Proceedings of the 7th international conference on RFID Security and Privacy
Locanyms: towards privacy-preserving location-based services
Proceedings of the 1st European Workshop on AppRoaches to MObiquiTous Resilience
MSN: mutual secure neighbor verification in multi-hop wireless networks
Security and Communication Networks
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
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
Efficient, secure, private distance bounding without key updates
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Elliptic curve-based RFID/NFC authentication with temperature sensor input for relay attacks
Decision Support Systems
| Hi-index | 0.00 |
The Mafia fraud consists in an adversary transparently relaying the physical layer signal during an authentication process between a verifier and a remote legitimate prover. This attack is a major concern for certain RFID systems, especially for payment related applications. Previously proposed protocols that thwart the Mafia fraud treat relaying and non-relaying types of attacks equally: whether or not signal relaying is performed, the same probability of false-acceptance is achieved. Naturally, one would expect that non-relay type of attacks achieve a lower probability of false-acceptance. We propose a low complexity authentication protocol that achieves a probability of false-acceptance essentially equal to the best possible false-acceptance probability in the presence of Mafia frauds. This performance is achieved without degrading the performance of the protocol in the non-relay setting. As an additional feature, the verifier can make a rational decision to accept or to reject a proof of identity even if the protocol gets unexpectedly interrupted.