Data Federation System for Multi-party Security
Author:
Affiliation:

  • Article
  • | |
  • Metrics
  • |
  • Reference [35]
  • |
  • Related [20]
  • | | |
  • Comments
    Abstract:

    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.

    Reference
    [1] Doan AH, Halevy A, Ives Z. Principles of Data Integration. Elsevier, 2012.
    [2] Shi DY, Wang YS, Zheng PF, Tong YX. Cross-Silo federated learning-to-rank. Ruan Jian Xue Bao/Journal of Software, 2021, 32(3):669-688(in Chinese with English abstract). http://www.jos.org.cn/1000-9825/6174.htm[doi:10.13328/j.cnki.jos.006174]
    [3] Liu C, Wang XS, Nayak K, et al. Oblivm:A programming framework for secure computation. In:Proc. of the 2015 IEEE Symp. on Security and Privacy. IEEE, 2015. 359-376.
    [4] Zahur S, Evans D. Obliv-C:A language for extensible data-oblivious computation. IACR Cryptology ePrint Archive, 2015, 2015: No.1153.
    [5] Bater J, Elliott G, Eggen C, et al. SMCQL:Secure query processing for private data networks. Proc. of the 2017 VLDB Endowment, 2017, 10(6):673-684.
    [6] Volgushev N, Schwarzkopf M, Getchell B, et al. Conclave:Secure multi-party computation on big data. In:Proc. of the 14th EuroSys Conf. ACM, 2019. No.3.
    [7] Hastings M, Hemenway B, Noble D, et al. Sok:General purpose compilers for secure multi-party computation. In:Proc. of the 2019 IEEE Symp. on Security and Privacy. IEEE, 2019. 1220-1237.
    [8] Bogdanov D, Laur S, Willemson J. Sharemind:A framework for fast privacy-preserving computations. In:Proc. of the 2008 European Symp. on Research in Computer Security. Berlin, Heidelberg:Springer, 2008. 192-206.
    [9] Keller M. MP-SPDZ:A versatile framework for multi-party computation. In:Proc. of the 2020 ACM SIGSAC Conf. on Computer and Communications Security. ACM, 2020. 1575-1590.
    [10] Shamir A. How to share a secret. Communications of the ACM, 1979, 22(11):612-613.
    [11] Yao AC. Protocols for secure computations. In:Proc. of the 23rd Annual Symp. on Foundations of Computer Science. IEEE, 1982. 160-164.
    [12] 1988. http://www.tpc.org/tpch/
    [13] Wang Y, Yi K. Secure Yannakakis:Join-aggregate queries over private data. In:Proc. of the 2021 Int'l Conf. on Management of Data. ACM, 2021. 1969-1981.
    [14] Sheth AP, Larson JA. Federated database systems for managing distributed, heterogeneous, and autonomous databases. ACM Computing Surveys, 1990, 22(3):183-236.
    [15] Josifovski V, Schwarz P, Haas L, et al. Garlic:A new flavor of federated query processing for DB2. In:Proc. of the 2002 ACM SIGMOD Int'l Conf. on Management of Data. ACM, 2002. 524-532.
    [16] Bellare M, Hoang VT, Rogaway P. Foundations of garbled circuits. In:Proc. of the 2012 ACM Conf. on Computer and Communications Security. ACM, 2012. 784-796.
    [17] Beimel A. Secret-sharing schemes:A survey. In:Proc. of the2011 Int'l Conf. on Coding and Cryptology. Berlin, Heidelberg: Springer, 2011. 11-46.
    [18] Setty S, Vu V, Panpalia N, et al. Taking proof-based verified computation a few steps closer to practicality. In:Proc. of the 21st USENIX Security Symp. ACM, 2012. 253-268.
    [19] Applebaum B. Key-dependent message security:Generic amplification and completeness. In:Proc. of the 2011 Annual Int'l Conf. on the Theory and Applications of Cryptographic Techniques. Berlin, Heidelberg:Springer, 2011. 527-546.
    [20] Chen F, Cheng S, Mohammed N, et al. Precise:Privacy-preserving cloud-assisted quality improvement service in healthcare. In: Proc. of the 8th Int'l Conf. on Systems Biology. IEEE, 2014. 176-183.
    [21] Kolesnikov V, Sadeghi AR, Schneider T. Improved garbled circuit building blocks and applications to auctions and computing minima. In:Proc. of the 2009 Int'l Conf. on Cryptology and Network Security. Berlin, Heidelberg:Springer, 2009. 1-20.
    [22] Kim HJ, Kim HI, Chang JW. A privacy-preserving kNN classification algorithm using Yao's garbled circuit on cloud computing. In:Proc. of the 2017 IEEE 10th Int'l Conf. on Cloud Computing. IEEE, 2017. 766-769.
    [23] Yao ACC. How to generate and exchange secrets. In:Proc. of the 27th Annual Symp. on Foundations of Computer Science. IEEE, 1986. 162-167.
    [24] Kilian J. Founding crytpography on oblivious transfer. In:Proc. of the 20th Annual ACM Symp. on Theory of Computing. ACM, 1988. 20-31.
    [25] Huang W, Langberg M, Kliewer J, et al. Communication efficient secret sharing. IEEE Trans. on Information Theory, 2016, 62(12): 7195-7206.
    [26] D'Souza R, Jao D, Mironov I, et al. Publicly verifiable secret sharing for cloud-based key management. In:Proc. of the 2011 Int'l Conf. on Cryptology in India. Berlin, Heidelberg:Springer, 2011. 290-309.
    [27] Naor M, Wool A. Access control and signatures via quorum secret sharing. IEEE Trans. on Parallel and Distributed Systems, 1998, 9(9):909-922.
    [28] Schoenmakers B. A simple publicly verifiable secret sharing scheme and its application to electronic voting. In:Proc. of the '99 Annual Int'l Cryptology Conf. Berlin, Heidelberg:Springer, 1999. 148-164.
    [29] Zhu Y, Yang YT, Sun ZW, Feng DG. Ownership proofs of digital works based on secure multiparty computation. Ruan Jian Xue Bao/Journal of Software, 2006, 17(1):157-166(in Chinese with English abstract). http://www.jos.org.cn/1000-9825/17/157.htm [doi:10.1360/jos170157]
    [30] Tan ZW, Zhang LF. Survey on privacy preserving techniques for machine learning. Ruan Jian Xue Bao/Journal of Software, 2020, 31. 7):2127-2156(in Chinese with English abstract). http://www.jos.org.cn/1000-9825/6052.htm[doi:10.13328/j.cnki.jos.006052]
    [31] Blakley GR. Safeguarding cryptographic keys. In:Proc. of the Int'l Workshop on Managing Requirements Knowledge. IEEE Computer Society, 1979. 313-313.
    附中文参考文献:
    [2] 史鼎元, 王晏晟, 郑鹏飞, 童咏昕. 面向企业数据孤岛的联邦排序学习. 软件学报, 2021, 32(3):669-688. http://www.jos.org.cn/1000-9825/6174.htm[doi:10.13328/j.cnki.jos.006174]
    [29] 朱岩, 杨永田, 孙中伟, 冯登国. 基于安全多方计算的数字作品所有权证明. 软件学报, 2006, 17(1):157-166. http://www.jos.org.cn/1000-9825/17/157.htm[doi:10.1360/jos170157]
    [30] 谭作文, 张连福. 机器学习隐私保护研究综述. 软件学报, 2020, 31. 7):2127-2156. http://www.jos.org.cn/1000-9825/6052.htm [doi:10.13328/j.cnki.jos.006052]
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

李书缘,季与点,史鼎元,廖旺冬,张利鹏,童咏昕,许可.面向多方安全的数据联邦系统.软件学报,2022,33(3):1111-1127

Copy
Share
Article Metrics
  • Abstract:2673
  • PDF: 6801
  • HTML: 3951
  • Cited by: 0
History
  • Received:June 30,2021
  • Revised:July 31,2021
  • Online: October 21,2021
  • Published: March 06,2022
You are the first2032355Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063