面向数据联邦的安全多方θ-连接算法  

Secure Multi-party θ-join Algorithm Toward Data Federation

作　　者：张媛媛[1,3] 李书缘 史烨轩 周南 徐毅 许可[1,2,3] ZHANG Yuan-Yuan;LI Shu-Yuan;SHI Ye-Xuan;ZHOU Nan;XU Yi;XU Ke(State Key Laboratory of Software Development Environment(Beihang University),Beijing 100191,China;Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing,Beihang University,Beijing 100191,China;School of Computer Science and Engineering,Beihang University,Beijing 100191,China;Institute of Artificial Intelligence,Beihang University,Beijing 100191,China;Shenyuan Honors College,Beihang University,Beijing 100191,China)

机构地区：[1]软件开发环境国家重点实验室(北京航空航天大学),北京100191 [2]北京航空航天大学未来区块链与隐私计算高精尖创新中心,北京100191 [3]北京航空航天大学计算机学院,北京100191 [4]北京航空航天大学人工智能研究院,北京100191 [5]北京航空航天大学沈元荣誉学院,北京100191

出　　处：《软件学报》2023年第3期1109-1125,共17页Journal of Software

基　　金：国家重点研发计划(2018AAA0101100);国家自然科学基金(U1811463,62076017);软件开发环境国家重点实验室(北京航空航天大学)开放课题(SKLSDE-2020ZX-07)。

摘　　要：近年来,多个国家地区出台了一系列数据安全相关的法律,例如欧盟的《通用数据保护条例》等.这些相关法律法规的出台,加剧了各企业机构等多方之间数据共享难的数据孤岛问题.数据联邦(data federation)正是解决该问题的可能出路.数据联邦是指多个数据拥有方在不泄露各自原始数据的前提下,结合安全多方计算等隐私计算技术,联合完成查询任务的计算.这一概念已成为近年来的研究热点,并涌现出一系列相关的代表性系统工作,如SMCQL、Conclave.然而,针对关系数据库系统中核心的连接查询,现有数据联邦系统还存在如下问题:首先,连接种类单一,难以满足复杂连接条件下的查询需求;其次,算法性能低下,由于现有系统往往直接调用安全工具库,其运行时间与通信开销高昂.因此,针对以上问题进行研究,提出了数据联邦下连接算法.主要贡献如下:首先,设计实现了面向多方的联邦安全算子,能够支持多种运算;其次,提出了支持θ-连接的联邦连接算法与优化策略,显著减少了连接查询所需安全计算代价;最后,基于基准数据集TPC-H,验证了该算法的性能.实验结果表明,与现有数据联邦系统SMCQL、Conclave相比,该算法能够将运行时间和通信开销分别降低61.33%和95.26%.Recently, many countries and regions have enacted data security policies, such as General Data Protection Regulation proposed by the EU. The release of related laws and regulations has aggravated the problem of data silos, whi ch makes it difficult to share data among various data owners. The data federation is a possible solution to this problem. Data federation refers to the calculat ion of query tasks jointly performed by multiple data owners without disclosing their original data and combining privacy computing technologies such as secure multi-party computation. This concept has become a research trend in recent years, and a series of representative systems have been proposed such as SMCQL and Conclave. However, for the fundamental join query in the relational database system, the existing data federation system still has the following problems. First of all, the join query type is single. It is difficult to meet the query requirements under complex join conditions. Secondly, the algorithm performance has huge improvement space, because the existing systems often call the security tool library directly, which has high running time and communication overhead. Therefore, a data federation join algorithm is proposed to address the above issues. The main contributions of this study are as follows. Firstly, multiparty-oriented federation security operators are designed and implemented, which can support a variety of operations. Secondly, a federated θ-join algorithm and an optimization strategy are proposed to significantly reduce the security computation cost. Finally, the performance of this proposal is verified based on the benchmark dataset TPC-H. The experimental results show that the proposed algorithm can reduce the runtime and communication overhead by 61.33% and 95.26% compared with the existing data federation system SMCQL and Conclave.

关 键 词：数据联邦 连接查询 安全多方计算 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]