arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.15007cs.CR
收藏

SQLite上的Cache侧信道攻击:基于噪声的数据库重构

Database Reconstruction from Noisy Volumes: A Cache Side-Channel Attack on SQLite

Aria Shahverdi, Mahammad Shirinov, Dana Dachman-Soled

摘要:

我们证明了在SQLite上的缓存侧信道攻击下数据库重建的可行性。具体来说,我们提出了一个刷新+的SQLite攻击,获得近似(或“嘈杂”)量的范围查询一个私人数据库。然后,我们提出了几种算法,一起,重建几乎确切的数据库在不同的实验条件下,这些近似卷。我们的重建算法采用新的技术的近似/嘈杂的设置,包括一个噪声容忍的团发现算法,一个“匹配和扩展”算法外推的体积从团省略,和“降噪步骤”,利用最接近的矢量问题(CVP)求解器,以提高重建数据库的整体精度。我们的攻击的时间复杂度随着查询属性范围的大小而快速增长,但可以很好地扩展到大型数据库。实验结果表明,我们可以重建大小为100,000和范围大小为12的数据库,在12小时内的错误率为0.11%的个人笔记本电脑。

英文摘要:

We demonstrate the feasibility of database reconstruction under a cache side-channel attack on SQLite. Specifically, we present a Flush+Reload attack on SQLite that obtains approximate (or "noisy") volumes of range queries made to a private database. We then present several algorithms that, taken together, reconstruct nearly the exact database in varied experimental conditions, given these approximate volumes. Our reconstruction algorithms employ novel techniques for the approximate/noisy setting, including a noise-tolerant clique-finding algorithm, a "Match & Extend" algorithm for extrapolating volumes that are omitted from the clique, and a "Noise Reduction Step" that makes use of a closest vector problem (CVP) solver to improve the overall accuracy of the reconstructed database. The time complexity of our attacks grows quickly with the size of the range of the queried attribute, but scales well to large databases. Experimental results show that we can reconstruct databases of size 100,000 and ranges of size 12 with error percentage of 0.11 % in under 12 hours on a personal laptop.

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

↑