Private Approximate Query over Horizontal Data Federation
Ala Eddine Laouir, Abdessamad Imine

TL;DR
This paper introduces a novel data distribution-aware sampling method for private federated range queries, significantly improving speed while maintaining privacy and accuracy in large-scale data analysis.
Contribution
It combines Approximate Query Processing and Differential Privacy with an online sampling technique tailored for federated environments, enhancing efficiency and privacy.
Findings
Up to 8x faster query processing compared to non-secure methods.
Maintains formal privacy guarantees and accuracy.
Resilient against learning-based privacy attacks.
Abstract
In many real-world scenarios, multiple data providers need to collaboratively perform analysis of their private data. The challenges of these applications, especially at the big data scale, are time and resource efficiency as well as end-to-end privacy with minimal loss of accuracy. Existing approaches rely primarily on cryptography, which improves privacy, but at the expense of query response time. However, current big data analytics frameworks require fast and accurate responses to large-scale queries, making cryptography-based solutions less suitable. In this work, we address the problem of combining Approximate Query Processing (AQP) and Differential Privacy (DP) in a private federated environment answering range queries on horizontally partitioned multidimensional data. We propose a new approach that considers a data distribution-aware online sampling technique to accelerate the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Privacy-Preserving Technologies in Data · Data Management and Algorithms
