fine-grained-trackability-in-protocol-executions@NDSS

Total: 1

#1 Fine-Grained Trackability in Protocol Executions [PDF1] [Copy] [Kimi1]

Authors: Ksenia Budykho (Surrey Centre for Cyber Security ; University of Surrey ; UK) ; Ioana Boureanu (Surrey Centre for Cyber Security ; University of Surrey ; UK) ; Steve Wesemeyer (Surrey Centre for Cyber Security ; University of Surrey ; UK) ; Daniel Romero (NCC Group) ; Matt Lewis (NCC Group) ; Yogaratnam Rahulan (5G/6G Innovation Centre - 5GIC/6GIC ; University of Surrey ; UK) ; Fortunat Rajaona (Surrey Centre for Cyber Security ; University of Surrey ; UK) ; Steve Schneider (Surrey Centre for Cyber Security ; University of Surrey ; UK)

We introduce a new framework, TrackDev, for encoding and analysing the tracing or "tracking" of an entity (e.g., a device) via its executions of a protocol or its usages of a system. TrackDev considers multiple dimensions combined: whether the attacker is active or passive, whether an entity is trackable in its every single appearances or just in a compound set thereof, and whether the entity can be explicitly or implicitly identified. TrackDev can be applied to most identification-based systems. TrackDev is to be applied in practice, over actual executions of systems; to this end, we test TrackDev on real-life traffic for two well-known protocols, the LoRaWAN Join and the 5G handovers, showing new trackability attacks therein and proposing countermeasures. We study the strength of TrackDev's various trackability properties and show that many of our notions are incomparable amongst each other, thus justifying the fine-grained nature of TrackDev. Finally, we detail how the main thrust of TrackDev can be mechanised in formal-verification tools, without any loss; we exemplify this fully on the LoRaWAN Join, in the Tamarin prover. In this process, we also uncover and discuss within two important aspects: (a) TrackDev’s separation between "explicit" and "implicit" trackability offers new formal-verification insights; (b) our analyses of the LoRaWAN Join protocol in Tamarin against TrackDev as well as against existing approximations of unlinkability by Baelde et al. concretely show that the latter approximations can be coarser than our notions.