Selected Publications

In this paper we formulate the problem of inferring locations of mobile agents, present theoretically-proven bounds on the amount of information that could be leaked in this manner, study their geometric nature, and present algorithms matching these bounds.
In MobiHoc 2018

In this work, we employ a ``mix-and-match'' approach to collect shorter trajectories, with which local geometric features of trajectories are preserved, while the re-identification of a user via frequent locations, co-locations and spatial-temporal points are not possible with high probability.
In SIGSPATIAL 2017

In this work, we employ the minhash signatures to store the trajectories with differential privacy guarantee and build a distributed data structure, MinHash hiearchy, to answer queries regarding popular paths efficiently.
In IPSN 2017

Recent Publications

  • Are Friends of My Friends Too Social? Limitations of Location Privacy in a Socially-Connected World

    Details PDF

  • Fighting Statistical Re-Identification in Human Trajectory Publication

    Details PDF

  • Competitive Analysis for Online Scheduling in Software-Defined Optical WAN

    Details PDF

  • MinHash Hierarchy for Privacy Preserving Trajectory Sensing and Query

    Details PDF

  • Decentralized Path Homotopy Detection and Classification Using Hodge Decomposition in Sensor Networks

    Details PDF

  • Understanding and Modelling Information Dissemination Patterns in Vehicle-to-Vehicle Networks

    Details PDF