P. Anjali, G. Swathi


We recommend that the cloud computing outsourcing process be clearly dismantled in companies working on LP solutions that work on cloud and LP parameters for the customer. Straight line programming is certainly an algorithm and computational tool that embodies the results of the first order of the various system parameters that must be improved and are necessary to improve geometry. It has been widely used in various engineering disciplines that evaluate and improve systems / models in the real world, for example, packet routing, flow control, power control in data centers, etc. However, how to protect the client's private data that has been processed and generated during the calculation has become the primary security source. By focusing on optimization tasks and engineering computing, this paper examines the secure outsourcing of relevant linear programming (LP) accounts. To validate the result of the calculation, we further explore the basic binomial theory of LP and derive the required and sufficient problems that the correct results must achieve. In the current curriculum, heavy encrypted accounts are shared by clouds, multi-protocol implementation processes or significant communication complexity. Our cloud customers provide significant savings in computing thanks to secure outsourcing to LP, as they generate only public costs for the customer, while solving the normal PL problem usually takes extra time..


Optimization; Cloud Computing; Linear Programming; Confidential Data; Computation Outsourcing;


W.Du and M. J. Atallah, “Secure multi-party computation problems and their applications: A review and open problems,” in Proc. New Secur. Paradigms Workshop, 2001, pp. 13–22.

R. Gennaro, C. Gentry, and B. Parno, “Non-interactive verifiable computing: Outsourcing computation to untrusted workers,” in Proc. 30th Annu. Conf. Adv. Cryptol., Aug. 2010, pp. 465–482.

O. Catrina and S. De Hoogh, “Secure multiparty linear programming using fixed-point arithmetic,” in Proc. 15th Eur. Conf. Res. Comput. Security, 2010, pp. 134–150.

P. Golle and I. Mironov, “Uncheatable distributed computations,” in Proc. Conf. Topics Cryptol.: The Cryptographer’s Track RSA, 2001, pp. 425–440.

P. Van Hentenryck, D. McAllester, andD. Kapur,“Solving polynomial systems using a branch and prune approach,” SIAM J. Numerical Anal., vol. 34, no. 2, pp. 797–827, 1997.

Cong Wang, Member, IEEE, Kui Ren, Senior Member, IEEE, and Jia Wang, Member, IEEE, “Secure Optimization Computation Outsourcingin Cloud Computing: A Case Studyof Linear Programming”, ieee transactions on computers, vol. 65, no. 1, january 2016.

C. Wang, K. Ren, and J. Wang, “Secure and practical outsourcing of linear programming in cloud computing,” in Proc. IEEE INFOCOM, 2011, pp. 820–828.

Full Text: PDF


  • There are currently no refbacks.

Copyright © 2012 - 2023, All rights reserved.|

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at