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
相关论文
共 50 条
  • [1] Efficient Noninteractive Outsourcing of Large-Scale QR and LU Factorizations
    Yu, Lingzan
    Ren, Yanli
    Feng, Guorui
    Zhang, Xinpeng
    SECURITY AND COMMUNICATION NETWORKS, 2021, 2021
  • [2] PERTURBATION THEORY FOR THE LU AND QR FACTORIZATIONS
    Wu, Chi-Ye
    Huang, Ting-Zhu
    ANZIAM JOURNAL, 2008, 49 (04): : 451 - 461
  • [3] ON THE PERTURBATION OF LU, CHOLESKY, AND QR FACTORIZATIONS
    STEWART, GW
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1993, 14 (04) : 1141 - 1145
  • [4] A DATA STRUCTURE FOR SPARSE QR AND LU FACTORIZATIONS
    GEORGE, A
    LIU, J
    NG, E
    SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1988, 9 (01): : 100 - 121
  • [5] Improved rigorous perturbation bounds for the LU and QR factorizations
    Li, Hanyu
    Wei, Yimin
    NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2015, 22 (06) : 1115 - 1130
  • [6] Secure large-scale bingo
    Martínez- Ballesté, A
    Sebé, F
    Domingo-Ferrer, J
    ITCC 2004: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, VOL 2, PROCEEDINGS, 2004, : 758 - 762
  • [7] COMMUNICATION-OPTIMAL PARALLEL AND SEQUENTIAL QR AND LU FACTORIZATIONS
    Demmel, James
    Grigori, Laura
    Hoemmen, Mark
    Langou, Julien
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2012, 34 (01): : A206 - A239
  • [8] ACCURATE MATRIX FACTORIZATION: INVERSE LU AND INVERSE QR FACTORIZATIONS
    Ogita, Takeshi
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2010, 31 (05) : 2477 - 2497
  • [9] CSTF: Large-Scale Sparse Tensor Factorizations on Distributed
    Blanco, Zachary
    Liu, Bangtian
    Dehnavi, Maryam Mehri
    PROCEEDINGS OF THE 47TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, 2018,
  • [10] On modified factorizations for large-scale linearly constrained optimization
    Gould, NIM
    SIAM JOURNAL ON OPTIMIZATION, 1999, 9 (04) : 1041 - 1063