An Optimal Relational Database Encryption Scheme
An Optimal Relational Database Encryption Scheme
复制标题
一种最优的关系数据库加密方案
DOI：
--
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Zheguang Zhao
中科院分区：
文献类型：
--
作者：
S. Kamara;Tarik Moataz;S. Zdonik;Zheguang Zhao
最近，Kamara和Moataz描述了第一个加密的关系数据库解决方案，该解决方案支持不使用属性保留加密的SQL的非平凡部分（Asiacrypt，2018）。更准确地说，它们的构造称为SPX，处理一组合取SQL查询。虽然SPX被证明是最佳的不相关的合取SQL查询的子集，它没有处理相关的查询最佳。此外，它只处理启发式范式的查询。在这项工作中，我们提出了一个扩展的SPX，最佳地处理所有的合取SQL查询，无论它们是在什么形式，以解决这些限制。brown.edu：zheguang. zhao@brown.edu
Recently, Kamara and Moataz described the first encrypted relational database solution with support for a non-trivial fraction of SQL that does not make use of property-preserving encryption (Asiacrypt, 2018). More precisely, their construction, called SPX, handles the set of conjunctive SQL queries. While SPX was shown to be optimal for the subset of uncorrelated conjunctive SQL queries, it did not handle correlated queries optimally. Furthermore, it only handles queries in heuristic normal form. In this work, we address these limitations by proposing an extension of SPX that handles all conjunctive SQL queries optimally no matter what form they are in. ∗seny@brown.edu †tarik@aroki.com ‡sbz@cs.brown.edu §zheguang.zhao@brown.edu