TraCS: Trajectory Collection in Continuous Space under Local Differential Privacy

• URL: http://arxiv.org/abs/2412.00620v1
• Date: Sun, 01 Dec 2024 00:07:04 GMT
• Title: TraCS: Trajectory Collection in Continuous Space under Local Differential Privacy
• Abstract summary: Local differential privacy (LDP) provides provable privacy guarantees for users, even when the data collector is untrusted.<n>Existing trajectory collection methods ensure LDP only for discrete location spaces.<n>This paper proposes two trajectory collection methods that ensure LDP for continuous spaces.
• Score: 5.90975025491779
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Trajectory collection is fundamental for location-based services but often involves sensitive information, such as a user's daily routine, raising privacy concerns. Local differential privacy (LDP) provides provable privacy guarantees for users, even when the data collector is untrusted. Existing trajectory collection methods ensure LDP only for discrete location spaces, where the number of locations affects their privacy guarantees and trajectory utility. Moreover, the location space is often naturally continuous, such as in flying and sailing trajectories, making these methods unsuitable. This paper proposes two trajectory collection methods that ensure LDP for continuous spaces: TraCS-D, which perturbs the direction and distance of locations, and TraCS-C, which perturbs the Cartesian coordinates of locations. Both methods are theoretically and experimentally analyzed for trajectory utility. TraCS can also be applied to discrete spaces by rounding perturbed locations to the nearest discrete points. It is independent of the number of locations and has only $\Theta(1)$ time complexity in each perturbation generation. Evaluation results on discrete location spaces validate this advantage and show that TraCS outperforms state-of-the-art methods with improved trajectory utility, especially for large privacy parameters.

Related papers

• Towards Personalized Differentially Private Learning for Decentralized Local Graphs [62.244412935520025]
  Local Differential Privacy (LDP) has emerged as a promising solution for privacy-preserving data collection without relying on trusted servers.<n>Existing LDP-based graph learning methods typically assume uniform privacy requirements across users.<n>We propose PPGNN, a personalized differentially private framework for decentralized graph data.
  arXiv  Detail & Related papers  (2026-07-06T08:07:48Z)
• Privacy Without Losing Place: A Paradigm for Private Retrieval in Spatial RAGs [5.928512439824825]
  PAS represents location with relative anchor encoding consisting of an anchor, direction bin, and distance bin.<n>We evaluate PAS on a synthetic urban dataset and show that it achieves impressive coarse privacy guarantees, with approximately 370-400m adversarial location error.
  arXiv  Detail & Related papers  (2026-05-06T21:33:43Z)
• A Privacy-Preserving Localization Scheme with Node Selection in Mobile Networks [48.845334743016345]
  We propose a privacy-preserving localization scheme, named PPLZN. PPLZN protects the location privacy of both the target and anchor nodes in crowdsourced localization.<n>It can achieve accurate position estimation without location leakage and outperform state-of-the-art approaches in both positioning accuracy and communication overhead.
  arXiv  Detail & Related papers  (2026-01-07T12:48:45Z)
• Personalized 3D Spatiotemporal Trajectory Privacy Protection with Differential and Distortion Geo-Perturbation [64.60694805725727]
  This paper proposes a personalized 3Dtemporal trajectory privacy protection mechanism named 3DSTPM.<n>We analyze the characteristics of attackers that exploit correlations between locations in a trajectory and present the attack model.<n>Results demonstrate that the proposed 3DSTPM effectively reduces loss while meeting the user's personalized privacy protection needs.
  arXiv  Detail & Related papers  (2025-11-27T07:41:14Z)
• Provable Privacy Guarantee for Individual Identities and Locations in Large-Scale Contact Tracing [4.436902019991021]
  Our paper proposes a highly scalable, practical contact tracing system called PREVENT. It can work with a variety of location collection methods to gain a comprehensive overview of a person's trajectory. Our system is very efficient and can provide real-time query services for large-scale datasets with millions of locations.
  arXiv  Detail & Related papers  (2024-09-18T22:19:48Z)
• Differentially Private Spatiotemporal Trajectory Synthesis with Retained Data Utility [0.3277163122167433]
  DP-STTS is a differentially private synthesizer with high data utility. Synthetic trajectories are generated from the noisy model. Experiments one real-life dataset demonstrate that DP-STTS provides good data utility.
  arXiv  Detail & Related papers  (2024-08-23T05:17:36Z)
• Enhancing stop location detection for incomplete urban mobility datasets [0.0]
  This study investigates the application of classification algorithms to enhance density-based methods for stop identification. Our approach incorporates multiple features, including individual routine behavior across various time and scales local characteristics of individual GPS points.
  arXiv  Detail & Related papers  (2024-07-16T10:41:08Z)
• PeFAD: A Parameter-Efficient Federated Framework for Time Series Anomaly Detection [51.20479454379662]
  We propose a. Federated Anomaly Detection framework named PeFAD with the increasing privacy concerns. We conduct extensive evaluations on four real datasets, where PeFAD outperforms existing state-of-the-art baselines by up to 28.74%.
  arXiv  Detail & Related papers  (2024-06-04T13:51:08Z)
• A Privacy-Preserving Trajectory Synthesis Method Based on Vector Translation Invariance Supporting Traffic Constraints [5.178920172140948]
  We propose an aggregation query based on the relationships between trajectories, so it can greatly improve the data utility as compared to the existing methods. We carry out extensive experiments to validate that the trajectories generated by our method have higher utility and the theoretic analysis shows that our method is safe and reliable.
  arXiv  Detail & Related papers  (2023-10-08T09:35:36Z)
• SpatialRank: Urban Event Ranking with NDCG Optimization on Spatiotemporal Data [55.609946936979036]
  We propose a novel spatial event ranking approach named SpatialRank. We show that SpatialRank can effectively identify the top riskiest locations of crimes and traffic accidents.
  arXiv  Detail & Related papers  (2023-09-30T06:20:21Z)
• DeepStay: Stay Region Extraction from Location Trajectories using Weak Supervision [4.243592852049962]
  Mobile devices enable constant tracking of the user's position and location trajectories can be used to infer personal points of interest (POIs) A common way to extract POIs is to first identify regions where a user spends a significant amount of time, known as stay regions (SRs) Common approaches to SR extraction are evaluated either solely unsupervised or on a small-scale private dataset. We propose a weakly and self-supervised transformer-based model called DeepStay, which is trained on location trajectories to predict stay regions.
  arXiv  Detail & Related papers  (2023-06-05T11:16:47Z)
• Spatiotemporal k-means [39.98633724527769]
  We propose a twotemporal clustering method called k-means (STk) that is able to analyze multi-scale clusters. We show how STkM can be extended to more complex machine learning tasks, particularly unsupervised region of interest detection and tracking in videos.
  arXiv  Detail & Related papers  (2022-11-10T04:40:31Z)
• Nonparametric extensions of randomized response for private confidence sets [51.75485869914048]
  This work derives methods for performing nonparametric, nonasymptotic statistical inference for population means under the constraint of local differential privacy (LDP) We present confidence intervals (CI) and time-uniform confidence sequences (CS) for $mustar$ when only given access to the privatized data.
  arXiv  Detail & Related papers  (2022-02-17T16:04:49Z)
• Escaping Saddle Points with Bias-Variance Reduced Local Perturbed SGD for Communication Efficient Nonconvex Distributed Learning [58.79085525115987]
  Local methods are one of the promising approaches to reduce communication time. We show that the communication complexity is better than non-local methods when the local datasets is smaller than the smoothness local loss.
  arXiv  Detail & Related papers  (2022-02-12T15:12:17Z)
• Real-time Outdoor Localization Using Radio Maps: A Deep Learning Approach [59.17191114000146]
  LocUNet: A convolutional, end-to-end trained neural network (NN) for the localization task. We show that LocUNet can localize users with state-of-the-art accuracy and enjoys high robustness to inaccuracies in the estimations of radio maps.
  arXiv  Detail & Related papers  (2021-06-23T17:27:04Z)
• Graph-Homomorphic Perturbations for Private Decentralized Learning [64.26238893241322]
  Local exchange of estimates allows inference of data based on private data. perturbations chosen independently at every agent, resulting in a significant performance loss. We propose an alternative scheme, which constructs perturbations according to a particular nullspace condition, allowing them to be invisible.
  arXiv  Detail & Related papers  (2020-10-23T10:35:35Z)
• A One-Pass Private Sketch for Most Machine Learning Tasks [48.17461258268463]
  Differential privacy (DP) is a compelling privacy definition that explains the privacy-utility tradeoff via formal, provable guarantees. We propose a private sketch that supports a multitude of machine learning tasks including regression, classification, density estimation, and more. Our sketch consists of randomized contingency tables that are indexed with locality-sensitive hashing and constructed with an efficient one-pass algorithm.
  arXiv  Detail & Related papers  (2020-06-16T17:47:48Z)
• Real-time Localization Using Radio Maps [59.17191114000146]
  We present a simple yet effective method for localization based on pathloss. In our approach, the user to be localized reports the received signal strength from a set of base stations with known locations.
  arXiv  Detail & Related papers  (2020-06-09T16:51:17Z)
• Infostop: Scalable stop-location detection in multi-user mobility data [0.0]
  We describe the Infostop algorithm that overcomes the limitations of the state-of-the-art solution by leveraging the flow-based network community detection algorithm Infomap. We show that the size of locations detected by Infostops for increasing number of users and that time complexity grows slower than for previous solutions.
  arXiv  Detail & Related papers  (2020-03-31T17:02:19Z)
• A Spatial-Temporal Attentive Network with Spatial Continuity for Trajectory Prediction [74.00750936752418]
  We propose a novel model named spatial-temporal attentive network with spatial continuity (STAN-SC) First, spatial-temporal attention mechanism is presented to explore the most useful and important information. Second, we conduct a joint feature sequence based on the sequence and instant state information to make the generative trajectories keep spatial continuity.
  arXiv  Detail & Related papers  (2020-03-13T04:35:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.