SecFact: Secure Large-scale QR and LU Factorizations

被引:36
作者
Luo, Changqing [1 ]
Zhang, Kaijin [1 ]
Salinas, Sergio [2 ]
Li, Pan [1 ]
机构
[1] Case Western Reserve Univ, Dept Elect Engn & Comp Sci, Cleveland, OH 44106 USA
[2] Wichita State Univ, Dept Elect Engn & Comp Sci, Wichita, KS 67260 USA
基金
美国国家科学基金会;
关键词
Big data; QR factorization; LU factorization; secure outsourcing; BIG DATA; ALGORITHM; SYSTEMS;
D O I
10.1109/TBDATA.2017.2782809
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We are now in the big data era. Due to the emerging various systems and applications, such as the Internet of Things, cyber-physical systems, smart cities, smart healthcare, we are able to collect more data than ever before. On the other hand, it makes it very difficult to analyze such massive data in order to advance our science and engineering fields. We note that QR and LU factorizations are two of the most fundamental mathematical tools for data analysis. However, conducting QR or LU factorization of an m x n matrix requires computational complexity of O(m(2)n). This incurs a formidable challenge in efficiently analyzing large-scale data sets by normal users or small companies on traditional resource-limited computers. To overcome this limitation, industry and academia propose to employ cloud computing that can offer abundant computing resources. This, however, obviously raises security concerns and hence a lot of users are reluctant to reveal their data to the cloud. To this end, we propose two secure outsourcing algorithms for efficiently performing large-scale QR and LU factorizations, respectively. We implement the proposed algorithms on the Amazon Elastic Compute Cloud (EC2) platform and a laptop. The experiment results show significant time saving for the user.
引用
收藏
页码:796 / 807
页数:12
相关论文
共 41 条
  • [1] Ackerman M. S., 2003, REV CHAPTER NEW EC H, P1
  • [2] [Anonymous], 2016, P IEEE INT C COMM MA
  • [3] [Anonymous], 2011, IDCS DIGITAL UNIVERS
  • [4] [Anonymous], 1971, ITERATIVE SOLUTION L
  • [5] Benson AR, 2013, IEEE INT CONF BIG DA
  • [6] Bertino E, 2005, PROC INT CONF DATA, P521
  • [7] Chung K., 2010, P ANN CRYPT C P ANN CRYPT C, P495
  • [8] Parallel algorithms for computing all possible subset regression models using the QR decomposition
    Gatu, C
    Kontoghiorghes, EJ
    [J]. PARALLEL COMPUTING, 2003, 29 (04) : 505 - 521
  • [9] Gennaro R, 2010, LECT NOTES COMPUT SC, V6223, P465, DOI 10.1007/978-3-642-14623-7_25
  • [10] ON THE COMPLEXITY OF SPARSE QR AND LU FACTORIZATION OF FINITE-ELEMENT MATRICES
    GEORGE, A
    NG, E
    [J]. SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1988, 9 (05): : 849 - 861