Private Approximate Query over Horizontal Data Federation
<|reference_start|>Private Approximate Query over Horizontal Data Federation: 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 execution of range queries and ensure end-to-end data privacy during and after analysis with minimal loss in accuracy. Through empirical evaluation, we show that our solution is able of providing up to 8 times faster processing than the basic non-secure solution while maintaining accuracy, formal privacy guarantees and resilience to learning-based attacks.<|reference_end|>
@article{laouir2024private,
    title={Private Approximate Query over Horizontal Data Federation},
    author={Ala Eddine Laouir and Abdessamad Imine},
    journal={arXiv preprint arXiv:2406.11421},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.11421},
    primaryClass={cs.DB cs.CR}
}