Efficient private database queries using ring-LWE somewhat homomorphic encryption
Efficient private database queries using ring-LWE somewhat homomorphic encryption
复制标题
DOI：
10.1016/j.jisa.2019.102406
复制
发表时间：
2019-12
期刊：
影响因子：
--
通讯作者：
T. Saha;Mayank Rathee;Takeshi Koshiba
中科院分区：
文献类型：
--
作者：
T. Saha;Mayank Rathee;Takeshi Koshiba
我们研究对任何外包加密数据库的私有数据库查询问题。 2016 年，Kim 等人。 [IEEE 传输。在可靠和安全计算上。]展示了三种私有查询处理协议，分别用于加密数据库上的联合、析取和阈值查询。首先，我们提出了两种比 Kim 等人的协议更有效的处理连接和析取查询的协议，其具有较低深度的等式电路。为了获得较低深度的电路，我们修改了 Saha 和 Koshiba [APWConCSE 2016] 的打包方法，以支持使用二进制编码数据在几次乘法中对我们的协议进行高效的批量计算。其次，我们提出了另一种有效的协议，采用批量技术进行阈值查询处理，其中许多不等式比较是必不可少的。最后，我们提出了支持许多不等式电路的批量计算的打包方法。此外，我们的理论分析和实际实验表明，我们的协议比任何其他现有方法都更有效。我们使用基本 N 固定长度编码进一步增强了联合和析取查询协议的性能。
We study the problem of private database queries over any outsourced encrypted database. In 2016, Kim et al. [IEEE Trans. on Dependable and Secure Comput.] showed three private query processing protocols for conjunctive, disjunctive, and threshold queries respectively over an encrypted database. First, we propose two more efficient protocols of processing conjunctive and disjunctive queries with a lower-depth equality circuit than Kim et al.’s one. To get the lower-depth circuit, we modify the packing methods of Saha and Koshiba [APWConCSE 2016] to support an efficient batch computation of our protocols within a few multiplications using binary encoded data. Secondly, we propose another efficient protocol engaging a batch technique for threshold query processing in which many inequality comparisons are indispensable. Finally, we propose the packing methods to support batch computation of many inequality circuits. In addition, our theoretical analysis along with practical experiments show that our protocols are more efficient than any other existing method. We further enhance the performance of conjunctive and disjunctive query protocols using a base-Nfixed-length encoding.