Manuscript Number : CSEIT172476
Secure Improvement Computation Outsourcing In Cloud Computing : A Case Study of Linear Programming
Authors(2) :-Bade Ankammarao, Ullamgunta Jalaja
Cloud computing has terrific ability of imparting robust computational electricity to the society at reduced cost. it allows clients with confined computational assets to outsource their huge computation workloads to the cloud, and economically enjoy the big computational energy, bandwidth, garage, or even suitable software program that may be shared in a pay-per-use manner. despite the first-rate blessings, safety is the number one impediment that prevents the wide adoption of this promising computing version, specially for customers while their personal data are ate up and produced at some point of the computation. treating the cloud as an intrinsically insecure computing platform from the viewpoint of the cloud customers, we must layout mechanisms that not best guard sensitive records by means of enabling computations with encrypted statistics, however additionally shield customers from malicious behaviors by means of enabling the validation of the computation result. one of these mechanism of trendy relaxed computation outsourcing was these days proven to be viable in principle, however to design mechanisms that are practically efficient remains a very challenging trouble. This paper investigates comfy outsourcing of widely applicable linear programming (lp) computations. in an effort to acquire sensible efficiency, our mechanism layout explicitly decomposes the lp computation outsourcing into public lp solvers running at the cloud and private lp parameters owned by way of the client. the resulting flexibility permits us to discover appropriate secu rity/performance tradeoff thru higher-level abstraction of lp computations than the general circuit representation.
Confidential Data, Secure Outsourcing Algorithms, Problem Optimization, Cloud Computing
- Cloud Cloud Security Alliance, "Security Guidance for Critical Areas of Focus in Cloud Computing," http://www.cloudsecurityalliance. org, 2009.
- K. Forsman, W. Gropp, L. Kettunen, D. Levine, and J. Salonen, "Solution of Dense Systems of Linear Equations Arising from Integral-Equation Formulations," IEEE Antennas and Propagation Magazine, vol. 37, no. 6, pp. 96-100, Dec. 1995.
- A. Edelman, "Large Dense Numerical Linear Algebra in 1993: The Parallel Computing Influence," Int'l J. HighPerformance Computing Applications, vol. 7, no. 2, pp. 113-128, 1993.
- K. Nissim and E. Weinreb, "Communication Efficient Secure Linear Algebra," Proc. Third Conf. Theory oCryptography (TCC), pp. 522-541, 2006.
- E. Kiltz, P. Mohassel, E. Weinreb, and M.K. Franklin, "Secure Linear Algebra Using Linearly Recurrent Sequences," Proc. Fourth Conf. Theory of Cryptography (TCC), pp. 291-310, 2007.
- J.R. Troncoso-Pastoriza, P. Comesana, and F. Perez-Gonzalez, "Secure Direct and Iterative Protocols for Solving Systems of Linear Equations," Proc. First Int'l Workshop Signal Processing in the EncryptEd Domain (SPEED), pp.122-141, 2009.
- Y. Saad, Iterative Methods for Sparse Linear Systems, second ed. Soc.for Industrial and Applied Math., 2003.
- P. Paillier, "Public-Key Cryptosystems Based on Composite Degree Residuosity Classes," EUROCRYPT: Proc. 17th Int'l Conf. Theory and Application of Cryptographic Techniques, pp. 223-238, 1999.
- D. Benjamin and M.J. Atallah, "Private and Cheating-Free Outsourcing of Algebraic Computations," Proc. SixthConf. Privacy, Security, and Trust (PST), pp. 240-245, 2008.C. Gentry, "Fully Homomorphic Encryption Using Ideal Lattices," Proc. 41st Ann. ACM Symp. Theory of computing (STOC), pp. 169-178, 2009.
- M.J. Atallah, K.N. Pantazopoulos, J.R. Rice, and E.H. Spafford, "Secure Outsourcing of Scientific Computations," Advances in Computers, vol. 54, pp. 216-272, 2001.
- C. Wang, K. Ren, and J. Wang, "Secure and Practical Outsourcing of Linear Programming in Cloud Computing," Proc. IEEE INFOCOM, pp. 820-828, 2011.
- D. Szajda, B.G. Lawson, and J. Owen, "Hardening Functions for Large Scale Distributed Computations," Proc. IEEE Symp. Security and Privacy, pp. 216-224, 2003.
- W. Du, J. Jia, M. Mangal, and M. Murugesan, "Uncheatable Grid Computing," Proc. 24th Int'l Conf. Distributed Computing Systems (ICDCS), pp. 4-11, 2004.
Published in : Volume 2 | Issue 4 | July-August 2017
Date of Publication : 2017-08-31
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 235-240
Manuscript Number : CSEIT172476
Publisher : Technoscience Academy
URL : http://ijsrcseit.com/CSEIT172476