Secure and Efficient Outsourcing of Large-Scale Overdetermined Systems of Linear Equations
We address overdetermined systems of linear equations, where the number of unknowns is smaller than the number of equations so that only approximate solutions exist instead of exact solutions. Such systems are prevalent in many areas of science and engineering, and finding the optimal solutions is mathematically known as the linear least squares (LLS) problem. Real-world overdetermined systems are often large-scale and computationally expensive to solve. Consequently, we are interested in connecting the LLS problem with cloud computing, where a resource-constrained client outsources the problem to a powerful but untrusted cloud. Among several security considerations is that the input of and solution to the LLS problem usually contain the client’s private information, which necessitates privacy-preserving outsourcing. In this paper, we present a construction called Sells, which employs a mathematical method called QR decomposition to solve the above problem, in a masked yet verifiable manner. One advantage of adopting QR decomposition is that in certain circumstances, solving a batch of LLS problems only requires fully executing Sells once, where certain intermediate result can be reused and the overall efficiency is greatly improved. Theoretical analysis shows that our proposal is verifiable, recoverable, and privacy-preserving. Experiments demonstrate that a client can benefit from the scheme not only reduced computation cost but also accelerated problem solving.
KeywordsLinear equations Overdetermined system Linear least squares Cloud computing Verifiable outsourcing Privacy preserving
The authors would like to thank the anonymous reviewers for their valuable comments. This work was supported by the National Basic Research Program of China (973 Program) under Grant 2014CB340603.
- 5.Edelman, A.: Large dense numerical linear algebra in 1993: the parallel computing influence. Int. J. High Perform. Comput. Appl. 7, 113–128 (1993)Google Scholar
- 8.Pan, S., Zheng, F., Zhu, W.-T., Wang, Q.: Harnessing the cloud for secure and efficient outsourcing of non-negative matrix factorization. In: the 6th IEEE Conference on Communications and Network Security (CNS 2018). IEEE (2018)Google Scholar
- 9.Salinas, S., Luo, C., Chen, X., Li, P.: Efficient secure outsourcing of large-scale linear systems of equations. In: 2015 IEEE Conference on Computer Communications (INFOCOM 2015), pp. 1035–1043. IEEE (2015)Google Scholar
- 10.Yu, Y., Luo, Y., Wang, D., Fu, S., Xu, M.: Efficient, secure and non-iterative outsourcing of large-scale systems of linear equations. In: 2016 IEEE International Conference on Communications (ICC 2016), p. 6. IEEE (2016)Google Scholar
- 15.Wang, C., Ren, K., Wang, K., Urs, K.M.R.: Harnessing the cloud for securely solving large-scale systems of linear equations. In: 31st IEEE International Conference on Distributed Computing Systems (ICDCS 2011), pp. 549–558. IEEE (2011)Google Scholar
- 17.Lei, X., Liao, X., Huang, T., Li, H., Hu, C.: Outsourcing large matrix inversion computation to a public cloud. IEEE Trans. Cloud Comput. 1, 78–87 (2013)Google Scholar
- 21.Plemmons, R.J.: FFT-based RLS in signal processing. In: 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 1993), pp. 571–574 (1993)Google Scholar
- 22.Solomon, C., Breckon, T.: Fundamentals of Digital Image Processing: A Practical Approach with Examples in MATLAB. Wiley-Blackwell, Hoboken (2011)Google Scholar
- 25.Salinas, S., Luo, C., Liao, W., Li, P.: Efficient secure outsourcing of large-scale quadratic programs. In: 11th ACM on Asia Conference on Computer and Communications Security (ASIA CCS 2016), pp. 281–292. ACM (2016)Google Scholar