Deakin University
Browse

Distance-bounding protocols: verification without time and location

Version 2 2024-06-04, 14:38
Version 1 2019-03-25, 15:23
conference contribution
posted on 2024-06-04, 14:38 authored by S Mauw, Z Smith, J Toro-Pozo, R Trujillo Rasua
Distance-bounding protocols are cryptographic protocols that securely establish an upper bound on the physical distance between the participants. Existing symbolic verification frameworks for distance-bounding protocols consider timestamps and the location of agents. In this work we introduce a causality-based characterization of secure distance-bounding that discards the notions of time and location. This allows us to verify the correctness of distance-bounding protocols with standard protocol verification tools. That is to say, we provide the first fully automated verification framework for distance-bounding protocols. By using our framework, we confirmed known vulnerabilities in a number of protocols and discovered unreported attacks against two recently published protocols.

History

Pagination

549-566

Location

San Francisco, Calif.

Open access

  • Yes

Start date

2018-05-20

End date

2018-05-24

ISSN

1081-6011

ISBN-13

9781538643525

Language

eng

Publication classification

E1.1 Full written paper - refereed

Copyright notice

2018, Sjouke Mauw

Editor/Contributor(s)

[Unknown]

Title of proceedings

SP 2018 : Proceedings of the 2018 IEEE 39th Symoposium on Security and Privacy

Event

IEEE Computer Society. Symposium (39th : 2018 : San Francisco, Calif.)

Publisher

Institute of Electrical and Electronics Engineers

Place of publication

Piscataway, N.J.

Series

IEEE Computer Society Symposium

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC