Efficient and Privacy-Preserving Distribution Statistics Analytics on Mobile Spatial Data

• URL: http://arxiv.org/abs/2605.25791v1
• Date: Mon, 25 May 2026 12:37:27 GMT
• Title: Efficient and Privacy-Preserving Distribution Statistics Analytics on Mobile Spatial Data
• Abstract summary: Performing efficient distributed statistical analysis on spatial data is crucial for real-time mobile computing applications.<n>Existing privacy-preserving techniques often introduce excessive overhead or inaccuracies.<n>In this paper, we design, implement, and evaluate the first system that supports efficient and privacy-preserving distribution statistics analysis for mobile spatial data.
• Score: 76.32349627923843
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: With the rapid development of mobile computing technology, massive amounts of spatial data are continuously generated from various mobile terminals and sensing devices, such as smartphones, connected vehicles, and drones. Performing efficient distributed statistical analysis on this data is crucial for real-time mobile computing applications. However, the constrained and dynamic nature of mobile environments exacerbates the privacy challenge: centralizing sensitive data for analysis risks severe privacy leaks, while existing privacy-preserving techniques often introduce excessive overhead or inaccuracies In this paper, we design, implement, and evaluate the first system that supports efficient and privacy-preserving distribution statistics analysis for mobile spatial data. First, we propose eSpat-B, which leverages two non-colluding servers and a newly designed improved distributed point functions (DPF) with octree partitioning. Furthermore, considering the frequent updates of spatial data, we propose another more efficient scheme, eSpat+. The core idea of this scheme is to utilize a K-Dimensional tree for spatial partitioning, combine it with incremental DPF for performing statistics analysis, and design an efficient update algorithm. Security analysis demonstrates that our schemes effectively protect data privacy throughout the statistical process. Theoretical analysis and experimental results on real-world mobile trajectory datasets demonstrate that our proposed schemes achieve a reduction of approximately 1.2* in computation overhead, 20* in communication overhead, and maintain 100% accuracy.

Related papers

• EPSpatial: Achieving Efficient and Private Statistical Analytics of Geospatial Data [27.954601303169007]
  Geospatial data statistics involve the aggregation and analysis of location data to derive the distribution of clients within geospatial.<n>The need for privacy protection in geospatial data analysis has become paramount due to concerns over the misuse or unauthorized access of client location information.<n>We propose $mathttEPSpatial$, a scheme for accurate, efficient, and private statistical analytics of geospatial data.
  arXiv  Detail & Related papers  (2025-05-19T01:51:30Z)
• Linear-Time User-Level DP-SCO via Robust Statistics [55.350093142673316]
  User-level differentially private convex optimization (DP-SCO) has garnered significant attention due to the importance of safeguarding user privacy in machine learning applications.<n>Current methods, such as those based on differentially private gradient descent (DP-SGD), often struggle with high noise accumulation and suboptimal utility.<n>We introduce a novel linear-time algorithm that leverages robust statistics, specifically the median and trimmed mean, to overcome these challenges.
  arXiv  Detail & Related papers  (2025-02-13T02:05:45Z)
• Share Secrets for Privacy: Confidential Forecasting with Vertical Federated Learning [5.584904689846748]
  Key challenges include data privacy and over-fitting on small and noisy datasets during both training and inference.<n>We propose Secret-shared Time Series Forecasting with VFL'' (STV), a novel framework with the following key features.<n>Results demonstrate that STV's forecasting accuracy is comparable to those of centralized approaches.
  arXiv  Detail & Related papers  (2024-05-31T12:27:38Z)
• Decentralized Stochastic Optimization with Inherent Privacy Protection [103.62463469366557]
  Decentralized optimization is the basic building block of modern collaborative machine learning, distributed estimation and control, and large-scale sensing. Since involved data, privacy protection has become an increasingly pressing need in the implementation of decentralized optimization algorithms.
  arXiv  Detail & Related papers  (2022-05-08T14:38:23Z)
• Efficient Logistic Regression with Local Differential Privacy [0.0]
  Internet of Things devices are expanding rapidly and generating huge amount of data. There is an increasing need to explore data collected from these devices. Collaborative learning provides a strategic solution for the Internet of Things settings but also raises public concern over data privacy.
  arXiv  Detail & Related papers  (2022-02-05T22:44:03Z)
• Linear Model with Local Differential Privacy [0.225596179391365]
  Privacy preserving techniques have been widely studied to analyze distributed data across different agencies. Secure multiparty computation has been widely studied for privacy protection with high privacy level but intense cost. matrix masking technique is applied to encrypt data such that the secure schemes are against malicious adversaries.
  arXiv  Detail & Related papers  (2022-02-05T01:18:00Z)
• Distributed Reinforcement Learning for Privacy-Preserving Dynamic Edge Caching [91.50631418179331]
  A privacy-preserving distributed deep policy gradient (P2D3PG) is proposed to maximize the cache hit rates of devices in the MEC networks. We convert the distributed optimizations into model-free Markov decision process problems and then introduce a privacy-preserving federated learning method for popularity prediction.
  arXiv  Detail & Related papers  (2021-10-20T02:48:27Z)
• Towards Efficient Scheduling of Federated Mobile Devices under Computational and Statistical Heterogeneity [16.069182241512266]
  This paper studies the implementation of distributed learning on mobile devices. We use data as a tuning knob and propose two efficient-time algorithms to schedule different workloads. Compared with the common benchmarks, the proposed algorithms achieve 2-100x speedup-wise, 2-7% accuracy gain and convergence rate by more than 100% on CIFAR10.
  arXiv  Detail & Related papers  (2020-05-25T18:21:51Z)
• Privacy-preserving Traffic Flow Prediction: A Federated Learning Approach [61.64006416975458]
  We propose a privacy-preserving machine learning technique named Federated Learning-based Gated Recurrent Unit neural network algorithm (FedGRU) for traffic flow prediction. FedGRU differs from current centralized learning methods and updates universal learning models through a secure parameter aggregation mechanism. It is shown that FedGRU's prediction accuracy is 90.96% higher than the advanced deep learning models.
  arXiv  Detail & Related papers  (2020-03-19T13:07:49Z)
• A Privacy-Preserving-Oriented DNN Pruning and Mobile Acceleration Framework [56.57225686288006]
  Weight pruning of deep neural networks (DNNs) has been proposed to satisfy the limited storage and computing capability of mobile edge devices. Previous pruning methods mainly focus on reducing the model size and/or improving performance without considering the privacy of user data. We propose a privacy-preserving-oriented pruning and mobile acceleration framework that does not require the private training dataset.
  arXiv  Detail & Related papers  (2020-03-13T23:52:03Z)

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.