面向数据联邦的安全多方连接算法
作者:
作者单位:

作者简介:

通讯作者:

李书缘,E-mail:{lishuyuan}@buaa.edu.cn.

中图分类号:

基金项目:

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


Secure Multi-part-Join Algorithms over Data Federation
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    近年来多个国家地区出台了一系列数据安全相关的法律,例如欧盟的《通用数据保护条例》等.这些相关法律法规的出台加剧了各企业机构等多方之间数据共享难的数据孤岛问题.数据联邦(Data Federation)正是解决该问题的可能出路.数据联邦是指多个数据拥有方在不泄露各自原始数据的前提下,结合安全多方计算等隐私计算技术,联合完成查询任务的计算.这一概念已成为近年来的研究热点,并涌现出一系列相关的代表性系统工作如SMCQL,Conclave.然而针对关系数据库系统中核心的连接查询,现有数据联邦系统还存在如下问题:首先连接种类单一,难以满足复杂连接条件下的查询需求;其次算法性能低下,由于现有系统往往直接调用安全工具库,其运行时间与通讯开销高昂.因此本文针对以上问题进行研究,提出了数据联邦下连接算法.本文主要贡献如下:-连接的联邦连接算法与优化策略,显著减少连接查询所需安全计算代价;最后基于基准数据集TPC-H验证本文算法性能,实验表明与现有数据联邦系统SMCQL, Conclave相比,本文所提算法能将运行时间和通讯开销分别降低61.33%与95.26%.

    Abstract:

    Recently,many countries and regions have enacted data security policies,such as the General Data Protection Regulation proposed by the EU.The release of related laws and regulations has aggravated the problem of data silos,which 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 calculation of query tasks jointly performed by multiple data owners without protecing their original data and combining privacy computing technologies such as secure multi-party computing.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 core relational database system join query,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,we propose a data federation join algorithm to address the above issues.The main contributions of this paper are as follows.Firstly,we design and implement multiparty-oriented federation security operators,which can support a variety of operations.Secondly,we propose a federated theta-join algorithm and an optimization strategy to significantly reduce the security computation cost.Finally,we verify the performance of this paper 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.

    参考文献
    相似文献
    引证文献
引用本文

张媛媛,李书缘,史烨轩,周南,徐毅,许可.面向数据联邦的安全多方连接算法.软件学报,2023,34(3):0

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2022-05-16
  • 最后修改日期:2022-09-07
  • 录用日期:
  • 在线发布日期: 2022-10-26
  • 出版日期:
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号