EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
On sharing secrets and Reed-Solomon codes
Communications of the ACM
Communications of the ACM
Contemporary Cryptology: The Science of Information Integrity
Contemporary Cryptology: The Science of Information Integrity
A Generalized Birthday Problem
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference 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
Looking on the Bright Side of Black-Box Cryptography (Transcript of Discussion)
Revised Papers from the 8th International Workshop on Security Protocols
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
Attacks on time-of-flight distance bounding channels
WiSec '08 Proceedings of the first ACM conference on Wireless network security
Keep your enemies close: distance bounding against smartcard relay attacks
SS'07 Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium
Wireless Communications & Mobile Computing
Towards Security Notions for White-Box Cryptography
ISC '09 Proceedings of the 12th International Conference on Information Security
RFID Distance Bounding Protocol with Mixed Challenges to Prevent Relay Attacks
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
RFID Distance Bounding Multistate Enhancement
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Reid et al.'s distance bounding protocol and mafia fraud attacks over noisy channels
IEEE Communications Letters
Effectiveness of distance-decreasing attacks against impulse radio ranging
Proceedings of the third ACM conference on Wireless network security
Distance bounding in noisy environments
ESAS'07 Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks
The Poulidor distance-bounding protocol
RFIDSec'10 Proceedings of the 6th international conference on Radio frequency identification: security and privacy issues
Realization of RF distance bounding
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Design of a secure distance-bounding channel for RFID
Journal of Network and Computer Applications
A framework for analyzing RFID distance bounding protocols
Journal of Computer Security - 2010 Workshop on RFID Security (RFIDSec'10 Asia)
Birthday paradox for multi-collisions
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Reducing time complexity in RFID systems
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
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
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
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 |
Terrorist fraud is a relay attack against distance bounding protocols where the prover conspires with an adversary to misrepresent the distance between himself and the verifier. In ideal situations, the adversary does not gain any knowledge about the prover's long-term secret. This makes designing a distance bounding protocol resistant to a such fraud tricky: the secrets of an honest prover must be protected, while those of a dishonest one should be disclosed as an incentive not to cheat. In this paper, we demonstrate that using a secret-sharing scheme, possibly based on threshold cryptography, is well suited for thwarting terrorist fraud. Although such an idea has been around since the work of Bussard and Bagga, this is the first time that secret-sharing and terrorist fraud have been systematically studied altogether. We prove that secret sharing can counter terrorist fraud, and we detail a method that can be applied directly to most existing distance bounding protocols. We illustrate our method on the protocol of Hancke and Kuhn, yielding two variants: the threshold distance bounding (tdb) protocol and the thrifty threshold distance bounding (ttdb) protocol. We define the adversarial strategies that attempt to gain some knowledge on the prover's long-term secret, evaluate the amount of information disclosed, and determine the adversary's success probability.