This repository contains a framework written in python for reasoning about abstract and practical proximity attacks against mobile targets.
The bounds folder contains code to calculate bounds on the number of queries an attacker needs to locate a random walk victim moving in one and two dimensionsional search spaces. The strategies folder contains the code to calculate the effort of practical (contrained) attacker strategies for synthetic and real-word data (T-Drive dataset).
This is joint work with Xiaolu Hou (Temasek Laboratories, Nanyang Technological University), Xueou Wang (Institute of Data Science, National University of Singapore), Nils Ole Tippenhauer (CISPA Helmholtz Center for Information Security) and Martin Ochoa (Appgate Inc.)