NDLI: Subtle kinks in distance-bounding: an analysis of prominent protocols

Please wait, while we are loading the content...

A pilot study on the security of pattern screen-lock methods and soft side channel attacks

Counter-jamming using mixed mechanical and software interference cancellation

6LoWPAN fragmentation attacks and mitigation mechanisms

Perfect contextual information privacy in WSNs undercolluding eavesdroppers

Securing the IP-based internet of things with HIP and DTLS

Entropy harvesting from physical sensors

Energy attacks and defense techniques for wireless systems

Who do you sync you are?: smartphone fingerprinting via application behaviour

Detection of reactive jamming in DSSS-based wireless networks

ETA: efficient and tiny and authentication for heterogeneous wireless systems

SnapMe if you can: privacy threats of other peoples' geo-tagged media and what we can do about it

Revisiting lightweight authentication protocols based on hard learning problems

ASK-BAN: authenticated secret key extraction utilizing channel characteristics for body area networks

Subtle kinks in distance-bounding: an analysis of prominent protocols

MAST: triage for market-scale mobile malware analysis

Selfish manipulation of cooperative cellular communications via channel fabrication

GPS+: a back-end coupons identification for low-cost RFID

Differential privacy in intelligent transportation systems

SeDyA: secure dynamic aggregation in VANETs

Chorus: scalable in-band trust establishment for multiple constrained devices over the insecure wireless channel

Efficient, secure, private distance bounding without key updates

Tap-Wave-Rub: lightweight malware prevention for smartphones using intuitive human gestures

The weakness of integrity protection for LTE

Private proximity testing with an untrusted server

Adversarial testing of wireless routing implementations

Countermeasures against sybil attacks in WSN based on proofs-of-work

Subtle kinks in distance-bounding: an analysis of prominent protocols

Content Provider	ACM Digital Library
Author	Fischlin, Marc Onete, Cristina
Abstract	Distance-bounding protocols prevent man-in-the-middle attacks by measuring response times. The four attacks such protocols typically address, recently formalized in [10], are: (1) mafia fraud, where the adversary must impersonate to a verifier in the presence of an honest prover; (2) terrorist fraud, where the adversary gets some offline prover support to impersonate; (3) distance fraud, where provers claim to be closer to verifiers than they really are; and (4) impersonations, where adversaries impersonate provers during lazy phases. Durholz et al. [10] also formally analyzed the security of (an enhancement of) the Kim-Avoine protocol [14]. In this paper we quantify the security of the following well-known distance-bounding protocols: Hancke and Kuhn [13], Reid et al. [16], the Swiss-Knife protocol [15], and the very recent proposal of Yang et al. [17]. Concretely, our main results show that (1) the usual terrorist-fraud countermeasure of relating responses to a long-term secret key may enable socalled key-learning mafia fraud attacks, where the adversary flips a single time-critical response to learn a key bit-by-bit; (2) though relating responses may allow mafia fraud, it sometimes enforces distance-fraud resistance by thwarting the attack of Boureanu et al. [5]; (3) none of the three allegedly terrorist-fraud resistant protocols, i.e. [15, 16, 17], is in fact terrorist fraud resistant; for the former two schemes this is a matter of syntax, attacks exploiting the strong formalization of [10]; the attack against the latter protocol of [17], however, is almost trivial; (4) unless key-update is done regardless of protocol completion, the protocol of Yang et al. is vulnerable to Denial-of-Service attacks. In light of our results, we also review definitions of terrorist fraud, arguing that, while the strong model in [10] may be at the moment more appropriate than mere intuition, it could be too strong to capture terrorist attacks.
Starting Page	195
Ending Page	206
Page Count	12
File Format	PDF
ISBN	9781450319980
DOI	10.1145/2462096.2462128
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-04-17
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Distance-bounding Protocol analysis Provable security Cryptography
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Optimal proximity proofs.

Symbolic verification of distance bounding protocols

Cryptographic puzzles and distance-bounding protocols: Practical tools for RFID security

A Distance Bounding Protocol Using Error State and Punishment

Security Analysis of two Distance-Bounding Protocols

Security Analysis of YKHL Distance Bounding Protocol with Adjustable False Acceptance Rate

Challenges in Distance Bounding

Rational distance-bounding protocols over noisy channel

RFID distance bounding protocol using m-ary challenges

Subtle kinks in distance-bounding: an analysis of prominent protocols

Similar Documents

Optimal proximity proofs.

Symbolic verification of distance bounding protocols

Cryptographic puzzles and distance-bounding protocols: Practical tools for RFID security

A Distance Bounding Protocol Using Error State and Punishment

Security Analysis of two Distance-Bounding Protocols

Security Analysis of YKHL Distance Bounding Protocol with Adjustable False Acceptance Rate

Challenges in Distance Bounding

Rational distance-bounding protocols over noisy channel

RFID distance bounding protocol using m-ary challenges

Subtle kinks in distance-bounding: an analysis of prominent protocols