arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.15023cs.DB
收藏

SIMD-PAC-DB:高效隐私保护数据库

SIMD-PAC-DB: Pretty Performant PAC Privacy

CWI(荷兰数学与计算机科学研究学会);MIT(麻省理工学院)

Ilaria Battiston, Dandan Yuan, Xiaochen Zhu, Peter Boncz

AI总结:

本文提出SIMD-PAC-DB,通过单次查询实现与原PAC-DB相同隐私保护结果,大幅提升性能与实用性。

摘要:

本文提出SIMD-PAC-DB,通过单次查询实现与原PAC-DB相同隐私保护结果,大幅提升性能与实用性。

英文摘要:

This work presents a highly optimized implementation of PAC-DB, a recent and promising database privacy model. We prove that our SIMD-PAC-DB can compute the same privatized answer with just a single query, instead of the 128 stochastic executions against different 50% database sub-samples needed by the original PAC-DB. Our key insight is that every bit of a hashed primary key can be seen to represent membership of such a sub-sample. We present new algorithms for approximate computation of stochastic aggregates based on these hashes, which, thanks to their SIMD-friendliness, run up to 40x faster than scalar equivalents. We release an open-source DuckDB community extension which includes a rewriter that PAC-privatizes arbitrary SQL queries. Our experiments on TPC-H, Clickbench, and SQLStorm evaluate thousands of queries in terms of performance and utility, significantly advancing the ease of use and functionality of privacy-aware data systems in practice.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑