Data Federation System for Multi-party Security

被引：0
作者：
Li S.-Y. [1 ,2 ,3 ]
Ji Y.-D. [4 ]
Shi D.-Y. [1 ,2 ,3 ]
Liao W.-D. [1 ,2 ,3 ]
Zhang L.-P. [1 ,2 ,3 ]
Tong Y.-X. [1 ,2 ,3 ]
Xu K. [1 ,2 ,3 ]
机构：
[1] State Key Laboratory of Software Development Enviroment, Beihang University, Beijing
[2] Beijing Advanced Innovation Center for Big Data and Brain Computing, Beihang University, Beijing
[3] School of Computer Science and Engineering, Beihang University, Beijing
[4] Information Center, Ministry of Science and Technology, Beijing
来源：
Ruan Jian Xue Bao/Journal of Software | 2022年 / 33卷 / 03期
关键词：
Data federation; Database system; Secure multi-party computation;
D O I：
10.13328/j.cnki.jos.006458
中图分类号：
学科分类号：
摘要：
In the era of big data, data is of great value as an essential factor of production. It is of great significance to implement its analysis, mining and utilization of large-scale data via data sharing. However, due to the heterogeneous dispersion of data and increasingly rigorous privacy protection regulations, data owners can not arbitrarily share data. This dilemma turns data owners into data silos. Data Federation calculate collaborative query while preserving the privacy of data silos. This study implements a multi-party secure relational data federation system. The system is designed based on the idea of federated computation that “data stays, computation moves”. Its adaptation interface of the system is different kinds of relational database adaptation, which can shield the data heterogeneity of multiple data owners. The system implements the multi-party security basic calculator library based on secret sharing, and the calculator realizes the optimization of the result reconstruction process. On this basis, it supports the query operations such as sum, average, maximum, equi-join and theta-join. Making full use of the multi-party properties to reduce the data interaction among data owners, the proposed system reduces the security computation overhead, so as to effectively support efficient data sharing. Finally, the experiment is carried out on the benchmark data set TPC-H. The experimental results show that the proposed system can support more data owners’ participation and has higher execution efficiency than current data federation systems such as SMCQL and Conclave by at most 3.75 times. © Copyright 2022, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：1111 / 1127
页数：16
相关论文
共 31 条
[1]  
Doan AH, Halevy A, Ives Z., Principles of Data Integration, (2012)
[2]  
Shi DY, Wang YS, Zheng PF, Tong YX., Cross-Silo federated learning-to-rank, Ruan Jian Xue Bao/Journal of Software, 32, 3, pp. 669-688, (2021)
[3]  
Liu C, Wang XS, Nayak K, Et al., Oblivm: A programming framework for secure computation, Proc. of the 2015 IEEE Symp. on Security and Privacy, pp. 359-376, (2015)
[4]  
Zahur S, Evans D., Obliv-C: A language for extensible data-oblivious computation, IACR Cryptology ePrint Archive, 2015, (2015)
[5]  
Bater J, Elliott G, Eggen C, Et al., SMCQL: Secure query processing for private data networks, Proc. of the 2017 VLDB Endowment, 10, 6, pp. 673-684, (2017)
[6]  
Volgushev N, Schwarzkopf M, Getchell B, Et al., Conclave: Secure multi-party computation on big data, Proc. of the 14th EuroSys Conf. ACM, (2019)
[7]  
Hastings M, Hemenway B, Noble D, Et al., Sok: General purpose compilers for secure multi-party computation, Proc. of the 2019 IEEE Symp. on Security and Privacy, pp. 1220-1237, (2019)
[8]  
Bogdanov D, Laur S, Willemson J., Sharemind: A framework for fast privacy-preserving computations, Proc. of the 2008 European Symp. on Research in Computer Security, pp. 192-206, (2008)
[9]  
Keller M., MP-SPDZ: A versatile framework for multi-party computation, Proc. of the 2020 ACM SIGSAC Conf. on Computer and Communications Security, pp. 1575-1590, (2020)
[10]  
Shamir A., How to share a secret, Communications of the ACM, 22, 11, pp. 612-613, (1979)
1234