Open Access Open Access  Restricted Access Subscription or Fee Access

Public Cryptography Linear Programming Solver in Cloud Computing

S.A. Phatangare, Dr.P.K. Deshmukh, R.A. Deshmukh

Abstract


Public-key cryptography refers to a cryptographic system requiring two separate keys, one of which is secret and one of which is public.Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsource their large computation workloads to the cloud, and economically enjoy the massive computational power, bandwidth, storage, and even appropriate software that can be shared in a pay-per-use manner. Despite the tremendous benefits, security is the primary obstacle that prevents the wide adoption of this promising computing model, especially for customers when their confidential data are consumed and produced during the computation. Treating the cloud as an intrinsically insecure computing platform from the viewpoint of the cloud customers, we must design mechanisms that not only protect sensitive information by enabling computations with encrypted data, but also protect customers from malicious behaviors by enabling the validation of the computation result. Focusing on engineering computing and optimization tasks, we investigates secure outsourcing of widely applicable linear programming (LP) computations. In order to achieve practical efficiency, our mechanism design explicitly decomposes the LP computation outsourcing into public LP solvers running on the cloud and private LP parameters owned by the customer. To validate the computation result, we explore the fundamental duality theorem of LP computation and derive the necessary and sufficient conditions that correct result must satisfy. In the proposed algorithm, the robustness preference of the output given by the server is checked by the client, whether the server is given the correct output. Whether the cloud is giving the correct result we also try to device the robust algorithm for numerical stability.

Keywords


LP Parser, LP Definition Creater, Public Cryptography, RSA Algorithm, Robust Algorithm

Full Text:

PDF

References


Cong Wang, Kui Ren, and Jia Wang , “Secure and Practical outsourcing of linear programming in Cloud computing” IEEE Transaction on cloud computing

P. Mell and T. Grance, “Draft nist working definition of cloud computing,” Referenced on Jan. 23rd, 2010 Online at http://csrc.nist.gov/ groups/SNS/cloud-computing/index.html, 2010.

Cloud Security Alliance, “Security guidance for critical areas of focus in cloud computing,” 2009, online at http://www.cloudsecurityalliance.org.

R. Gennaro, C. Gentry, and B. Parno, “Non-interactive verifiable computing: Outsourcing computation to untrusted workers,” in Proc. Of CRYPTO’10, Aug. 2010.

C. Wang, N. Cao, J. Li, K. Ren, and W. Lou, “Secure ranked keyword search over encrypted cloud data,” in Proc. of ICDCS’10, 2010.

S. Yu, C. Wang, K. Ren, and W. Lou, “Achieving secure, scalable, and fine-grained access control in cloud computing,” in Proc. of IEEE INFOCOM’10, San Diego, CA, USA, March 2010.

D. Luenberger and Y. Ye, Linear and Nonlinear Programming, 3rd ed. Springer, 2008.

C. Wang, N. Cao, J. Li, K. Ren, and W. Lou, “Secure ranked keyword search over encrypted cloud data,” in Proc. of ICDCS’10, 2010.

S. Yu, C. Wang, K. Ren, and W. Lou, “Achieving secure, scalable, and fine-grained access control in cloud computing,” in Proc. of IEEE INFOCOM’10, San Diego, CA, USA, March 2010.

S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. MIT press, 2008.

V. Strassen, “Gaussian elimination is not optimal,” Numer. Math., vol. 13, pp. 354–356, 1969.

D. Coppersmith and S. Winograd, “Matrix multiplication via arithmetic progressions,” in Proc. of STOC’87, 1987, pp. 1–6.

MOSEK ApS, “The MOSEK Optimization Software,” Online at http: //www.mosek.com/, 2010.

P. Paillier, “Public-key cryptosystems based on composite degree residuosity classes,” in Proc. Of EUROCRYPT’99, 1999, pp. 223– 238.

S. Even, O. Goldreich, and A. Lempel, “A randomized protocol for signing contracts,” Commun. ACM, vol. 28, no. 6, pp. 637–647, 1985


Refbacks

  • There are currently no refbacks.