Securely and efficiently perform large matrix rank decomposition computation via cloud computing

Cloud computing enables resource-constrained clients to economically outsource their huge computation workloads to a powerful cloud server. This promising computing paradigm is able to realize client-cloud cooperative computations. It also brings in new security concerns and challenges, such as input/output privacy and efficiency. Since large matrix rank decomposition computation (RDC) is ubiquitous in the fields of science and engineering, a first step is taken forward to design a protocol that enables clients to securely and efficiently outsource RDC to a public cloud in this paper. It is analytically shown that the proposed protocol is correct and secure. Extensive theoretical analysis and experimental evaluation also show its high-efficiency and immediate practicability. It is hoped that the proposed protocol can shed light on designing other novel secure outsourcing protocols, and inspire powerful companies and working groups to finish the programming of the demanded all-inclusive scientific computations outsourcing software system. It is believed that such software system can be profitable by means of providing large-scale scientific computation services for so many potential clients. The proposed RDC outsourcing protocol is a step forward to realize such integrated software system.

[1]  Jing-Yu Yang,et al.  Optimal fisher discriminant analysis using the rank decomposition , 1992, Pattern Recognit..

[2]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[3]  Eugene H. Spafford,et al.  Secure outsourcing of scientific computations , 2001, Adv. Comput..

[4]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[5]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[6]  Mikhail J. Atallah,et al.  Securely outsourcing linear algebra computations , 2010, ASIACCS '10.

[7]  Götz Trenkler,et al.  Generalized and hypergeneralized projectors , 1997 .

[8]  Mikhail J. Atallah,et al.  Private and Cheating-Free Outsourcing of Algebraic Computations , 2008, 2008 Sixth Annual Conference on Privacy, Security and Trust.

[9]  Shin-ichi Kawamura,et al.  Fast Server-Aided Secret Computation Protocols for Modular Exponentiation , 1993, IEEE J. Sel. Areas Commun..

[10]  Craig Gentry,et al.  A fully homomorphic encryption scheme , 2009 .

[11]  Weimin Zheng,et al.  Design a cloud storage platform for pervasive computing environments , 2009, Cluster Computing.

[12]  Cong Wang,et al.  Harnessing the Cloud for Securely Outsourcing Large-Scale Systems of Linear Equations , 2013, IEEE Transactions on Parallel and Distributed Systems.

[13]  Craig Gentry,et al.  Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.

[14]  Mark Ryan,et al.  Cloud computing security: The scientific challenge, and a survey of solutions , 2013, J. Syst. Softw..

[15]  Anna Lysyanskaya,et al.  How to Securely Outsource Cryptographic Computations , 2005, TCC.

[16]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[17]  I. N. Imam,et al.  Using rank factorization in calculating the Moore-Penrose generalized inverse , 1989, Proceedings. IEEE Energy and Information Technologies in the Southeast'.

[18]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[19]  Cong Wang,et al.  Harnessing the Cloud for Securely Solving Large-Scale Systems of Linear Equations , 2011, 2011 31st International Conference on Distributed Computing Systems.

[20]  El-Ghazali Talbi,et al.  A Pareto-based metaheuristic for scheduling HPC applications on a geographically distributed cloud federation , 2013, Cluster Computing.

[21]  Phong Q. Nguyen,et al.  Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers , 2012, IACR Cryptol. ePrint Arch..

[22]  Yehuda Lindell,et al.  Secure Multiparty Computation for Privacy-Preserving Data Mining , 2009, IACR Cryptol. ePrint Arch..

[23]  Pierre Courrieu,et al.  Fast Computation of Moore-Penrose Inverse Matrices , 2008, ArXiv.

[24]  Yael Tauman Kalai,et al.  Delegating computation: interactive proofs for muggles , 2008, STOC.

[25]  Arne Storjohann,et al.  Integer matrix rank certification , 2009, ISSAC '09.

[26]  Tao Xiang,et al.  Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud , 2014, J. Parallel Distributed Comput..

[27]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming) , 2005 .

[28]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[29]  Cong Wang,et al.  Privacy-Assured Outsourcing of Image Reconstruction Service in Cloud , 2013, IEEE Transactions on Emerging Topics in Computing.

[30]  Tingwen Huang,et al.  Outsourcing Large Matrix Inversion Computation to A Public Cloud , 2013, IEEE Transactions on Cloud Computing.

[31]  El-Ghazali Talbi,et al.  A pareto-based GA for scheduling HPC applications on distributed cloud infrastructures , 2011, 2011 International Conference on High Performance Computing & Simulation.

[32]  Yael Tauman Kalai,et al.  Improved Delegation of Computation using Fully Homomorphic Encryption , 2010, IACR Cryptol. ePrint Arch..

[33]  Andrew R. Webb,et al.  Statistical Pattern Recognition , 1999 .

[34]  Cong Wang,et al.  Secure and practical outsourcing of linear programming in cloud computing , 2011, 2011 Proceedings IEEE INFOCOM.