Outsourcing Large-Scale Quadratic Programming to a Public Cloud

Cloud computing provides service for resource-constrained customers to perform large-scale scientific computation. However, it also brings some new challenges, which have to be considered in designing outsourcing protocols. In recent years, a few outsourcing protocols have been proposed for different kinds of problems. Quadratic programming (QP) is a class of mathematical optimization problem, and solving a large-scale QP problem requires a large amount of computation. Thus, there is a great need for customer to outsource large-scale QP problem to cloud. In this paper, we design a secure, verifiable, and efficient outsourcing protocol for QP problem. For security consideration, we encrypt the matrices and vectors contained in the QP problem in an efficient way. After cloud computing, we decrypt the result to get the ultimate solution. To ensure correctness, we verify the result returned by the cloud through Karush-Kuhn-Tucker conditions that are the necessary and sufficient conditions for the optimal solution. We also present complexity analysis and numerical simulations to illustrate the efficiency of our outsourcing protocol.

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

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

[3]  Cong Wang,et al.  Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing , 2010, 2010 Proceedings IEEE INFOCOM.

[4]  Yonina C. Eldar,et al.  Convex Optimization in Signal Processing and Communications , 2009 .

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

[6]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[7]  Tingwen Huang,et al.  Achieving security, robust cheating resistance, and high-efficiency for outsourcing large matrix multiplication computation to a malicious cloud , 2014, Inf. Sci..

[8]  Hui Li,et al.  Oruta: Privacy-Preserving Public Auditing for Shared Data in the Cloud , 2012, 2012 IEEE Fifth International Conference on Cloud Computing.

[9]  Stephen P. Boyd,et al.  Real-Time Convex Optimization in Signal Processing , 2010, IEEE Signal Processing Magazine.

[10]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[11]  Tingwen Huang,et al.  Cloud Computing Service: The Caseof Large Matrix Determinant Computation , 2015, IEEE Transactions on Services Computing.

[12]  Cong Wang,et al.  Proof-Carrying Cloud Computation: The Case of Convex Optimization , 2014 .

[13]  Edmund Y. Lam,et al.  Blind Bi-Level Image Restoration With Iterated Quadratic Programming , 2007, IEEE Transactions on Circuits and Systems II: Express Briefs.

[14]  S. Zenios.  Financial optimization: Models , 1993 .

[15]  Luis Rodero-Merino,et al.  A break in the clouds: towards a cloud definition , 2008, CCRV.

[16]  C. Schlegel,et al.  On coverage and routing in wireless ad hoc networks , 2006, IEEE Signal Processing Magazine.

[17]  Cong Wang,et al.  Secure Ranked Keyword Search over Encrypted Cloud Data , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[18]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[19]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[20]  Cong Wang,et al.  Security Challenges for the Public Cloud , 2012, IEEE Internet Computing.

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

[22]  Mariano Rivera,et al.  Image segmentation by convex quadratic programming , 2008, 2008 19th International Conference on Pattern Recognition.

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

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

[25]  Baochun Li,et al.  Oruta: Privacy-Preserving Public Auditingfor Shared Data in the Cloud , 2014, IEEE Trans. Cloud Comput..

[26]  C. McDiarmid.  SIMULATED ANNEALING AND BOLTZMANN MACHINES A Stochastic Approach to Combinatorial Optimization and Neural Computing , 1991 .

[27]  Nello Cristianini,et al.  An Introduction to Support Vector Machines and Other Kernel-based Learning Methods , 2000 .

[28]  Yinyu Ye,et al.  On the complexity of approximating a KKT point of quadratic programming , 1998, Math. Program..

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

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

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