Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Back to Paper
cs.CR

Local ID: 2605.25791v2

AI Summary: gemma4:e4b

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

By Xuhao Ren, Mingyang Zhao, Ruichen Zhang, Liehuang Zhu, Bin Xiao

Revision History Timeline

v15/25/2026
5/25/2026

No submitter comment provided.

v26/4/2026
6/4/2026

No submitter comment provided.

★ Version indexed in Explorer
v36/17/2026
6/17/2026

No submitter comment provided.

Comparing v2 vs v3

Green = Added • Red = Removed

Title Comparison

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

Authors Comparison

Removed:Ruichen Zhang
Added:Chuan ZhangMeng Li
Unchanged:Xuhao Ren, Mingyang Zhao, Liehuang Zhu, Bin Xiao

v2 Comment

No comment for this version.

v3 Comment

No comment for this version.

Abstract Word Diff

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. Extensive experiments on real-world trajectory datasets demonstrate that the proposed schemes significantly outperform existing approaches, reducing computation overhead by up to 1.2x and communication overhead by up to 20x while maintaining 100% statistical accuracy.
View Full Version History on arXiv