Analysing Fairness of Privacy-Utility Mobility Models

Yuting Zhan, Hamed Haddadi, Afra Mashhadi
4/10/2023
cs.LGcs.AIcs.CR

No confident code implementation found for this paper.

Abstract

Preserving the individuals' privacy in sharing spatial-temporal datasets is critical to prevent re-identification attacks based on unique trajectories. Existing privacy techniques tend to propose ideal privacy-utility tradeoffs, however, largely ignore the fairness implications of mobility models and whether such techniques perform equally for different groups of users. The quantification between fairness and privacy-aware models is still unclear and there barely exists any defined sets of metrics for measuring fairness in the spatial-temporal context. In this work, we define a set of fairness metrics designed explicitly for human mobility, based on structural similarity and entropy of the trajectories. Under these definitions, we examine the fairness of two state-of-the-art privacy-preserving models that rely on GAN and representation learning to reduce the re-identification rate of users for data sharing. Our results show that while both models guarantee group fairness in terms of demographic parity, they violate individual fairness criteria, indicating that users with highly similar trajectories receive disparate privacy gain. We conclude that the tension between the re-identification task and individual fairness needs to be considered for future spatial-temporal data analysis and modelling to achieve a privacy-preserving fairness-aware setting.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zhan2023analysing,
  title  = {Analysing Fairness of Privacy-Utility Mobility Models},
  author = {Yuting Zhan and Hamed Haddadi and Afra Mashhadi},
  year   = {2023},
  eprint = {2304.06469},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.06469v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.06469.svg)](https://codeofpaper.com/paper/2304.06469)

Discussion