Distance-Based Data Mining over Encrypted Data
Distance-Based Data Mining over Encrypted Data
复制标题
DOI：
10.1109/icde.2018.00126
复制
发表时间：
2018-04
期刊：
影响因子：
--
通讯作者：
Christine Tex;Martin Schäler;Klemens Böhm
中科院分区：
文献类型：
--
作者：
Christine Tex;Martin Schäler;Klemens Böhm
在挖掘数据时，组织依赖服务提供商来进行分析。然而，数据所有者通常只愿意在加密时传输数据。所以加密必须保存挖掘结果。由于许多挖掘算法是基于距离的，我们提出了距离保持加密（DPE）的概念。设计一个DPE方案是具有挑战性的，因为它取决于数据和使用的距离测量。我们提出了一个程序，工程DPE计划，被称为KIT-DPE。在一个案例研究中，我们为SQL查询日志实例化KIT-DPE。我们设计的DPE计划的所有SQL查询距离的措施，从文献。对于所有这些措施，我们证明，可以使用现有的财产保护加密方案与已知的安全特性的组合，以保证相同的挖掘结果。
When mining data, organizations rely on service providers to carry out the analyses. However, data owners often are only willing to transfer their data when it is encrypted. So encryption must preserve the mining results. Since many mining algorithms are distance-based, we propose the notion of distance-preserving encryption (DPE). Designing a DPE-scheme is challenging, as it depends both on the data and the distance measure in use. We propose a procedure to engineer DPE-schemes, dubbed KIT-DPE. In a case study, we instantiate KIT-DPE for SQL query logs. We design DPE-schemes for all SQL query-distance measures from the literature. For all these measures, we prove that one can use a combination of existing property-preserving encryption schemes with known security characteristics to guarantee the same mining result.