Designing a Location Trace Anonymization Contest

07/22/2021
by   Takao Murakami, et al.
0

For a better understanding of anonymization methods for location traces, we have designed and held a location trace anonymization contest. Our contest deals with a long trace (400 events per user) and fine-grained locations (1024 regions). In our contest, each team anonymizes her original traces, and then the other teams perform privacy attacks against the anonymized traces in a partial-knowledge attacker model where the adversary does not know the original traces. To realize such a contest, we propose a location synthesizer that has diversity and utility; the synthesizer generates different synthetic traces for each team while preserving various statistical features of real traces. We also show that re-identification alone is insufficient as a privacy risk and that trace inference should be added as an additional risk. Specifically, we show an example of anonymization that is perfectly secure against re-identification and is not secure against trace inference. Based on this, our contest evaluates both the re-identification risk and trace inference risk and analyzes their relationship. Through our contest, we show several findings in a situation where both defense and attack compete together. In particular, we show that an anonymization method secure against trace inference is also secure against re-identification under the presence of appropriate pseudonymization.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/28/2018

Privacy of Dependent Users Against Statistical Matching

Modern applications significantly enhance user experience by adapting to...
research
05/02/2018

Privacy against Statistical Matching: Inter-User Correlation

Modern applications significantly enhance user experience by adapting to...
research
07/17/2019

Privacy-Aware Location Sharing with Deep Reinforcement Learning

Location based mobile applications have become widely popular. Despite t...
research
07/11/2019

Trace-Relating Compiler Correctness and Secure Compilation

Compiler correctness is, in its simplest form, defined as the inclusion ...
research
02/18/2019

Asymptotic Limits of Privacy in Bayesian Time Series Matching

Various modern and highly popular applications make use of user data tra...
research
11/17/2021

MASS: Mobile Autonomous Station Simulation

We propose a set of tools to replay wireless network traffic traces, whi...
research
10/04/2021

SecurePtrs: Proving Secure Compilation with Data-Flow Back-Translation and Turn-Taking Simulation

Proving secure compilation of partial programs typically requires back-t...

Please sign up or login with your details

Forgot password? Click here to reset