Towards meaningful distance-preserving encryption
Towards meaningful distance-preserving encryption
复制标题
DOI：
10.1145/3221269.3223029
复制
发表时间：
2018-07
期刊：
影响因子：
--
通讯作者：
Christine Tex;Martin Schäler;Klemens Böhm
中科院分区：
文献类型：
--
作者：
Christine Tex;Martin Schäler;Klemens Böhm
挖掘复杂数据是一项必要的同时也是具有挑战性的任务。因此，组织将其加密数据传递给执行此类分析的服务提供商。因此，加密必须保留挖掘结果。许多挖掘算法都是基于距离的。因此，我们研究如何在加密时保存这些算法的结果。为此，我们提出了距离保持加密（DPE）的概念。这个概念具有恰到好处的严谨性——我们用形式论证和实验证明了我们不能放松它。设计DPE方案具有挑战性，因为它既取决于数据集，也取决于所使用的特定距离度量。我们提出了一个程序来设计dpe方案，称为DisPE。在案例研究中，我们为SQL查询日志实例化DisPE，这是一种包含有关用户兴趣的有价值信息的数据类型。在本研究中，我们为科学文献中的所有SQL查询距离度量设计了DPE方案。我们正式表明，可以使用现有的安全属性保护加密方案的组合来实现这一目的。最后，我们用另外两个数据集作为例子讨论了我们的发现的普遍性。
Mining complex data is an essential and at the same time challenging task. Therefore, organizations pass on their encrypted data to service providers carrying out such analyses. Thus, encryption must preserve the mining results. Many mining algorithms are distance-based. Thus, we investigate how to preserve the results for such algorithms upon encryption. To this end, we propose the notion of distance-preserving encryption (DPE). This notion has just the right strictness - we show that we cannot relax it, using formal arguments as well as experiments. Designing a DPE scheme is challenging, as it depends both on the data set and the specific distance measure in use. We propose a procedure to engineer DPE-schemes, dubbed DisPE. In a case study, we instantiate DisPE for SQL query logs, a type of data containing valuable information about user interests. In this study, we design DPE schemes for all SQL query distance measures from the scientific literature. We formally show that one can use a combination of existing secure property-preserving encryption schemes to this end. Finally, we discuss on the generalizability of our findings using two other data sets as examples.