The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - {} (2013 vol.1)
pp: 1
Xinyu Lei , Chongqing University, Chongqing
Xiaofeng Liao , Chongqing University, Chongqing
Tingwen Huang , Texas A&M University at Qatar, Doha
Huaqing Li , Chongqing University, Chongqing
Chunqiang Hu , George Washington University, Washington
ABSTRACT
Cloud computing enables resource-constrained clients to economically outsource their huge computation workloads to a cloud server with massive computational power. This promising computing paradigm inevitably brings in new security concerns and challenges, such as input/output privacy and result verifiability. Since matrix inversion computation (MIC) is a quite common scientific and engineering computational task, we are motivated to design a protocol to enable secure, robust cheating resistant, and efficient outsourcing of MIC to a malicious cloud in this paper. The main idea to protect the privacy is employing some transformations on the original matrix to get a encrypted matrix which is sent to the cloud; and then transforming the result returned from the cloud to get the correct inversion of the original matrix. Next, a randomized Monte Carlo verification algorithm with one-sided error is employed to successfully handle result verification. In this paper, the superiority of this novel technique in designing inexpensive result verification algorithm for secure outsourcing is well demonstrated. We analytically show that the proposed protocol simultaneously fulfills the goals of correctness, security, robust cheating resistance, and high-efficiency. Extensive theoretical analysis and experimental evaluation also show its high-efficiency and immediate practicability.
INDEX TERMS
Outsourcing, Resource management, Work load management, Cryptography, Privacy, Computational modeling, Matrix inversion, Outsourcing, Resource management, Work load management, Cryptography, Privacy, Computational modeling, Data Encryption
CITATION
Xinyu Lei, Xiaofeng Liao, Tingwen Huang, Huaqing Li, Chunqiang Hu, "Outsourcing Large Matrix Inversion Computation to A Public Cloud", IEEE Transactions on Cloud Computing, vol.1, no. 1, pp. 1, {} 2013, doi:10.1109/TCC.2013.7
REFERENCES
[1] G. Brunette and R. Mogull, "Security Guidance for Critical Areas of Focus in Cloud Computing V2.1," Cloud Security Alliance, pp. 1-76, 2009.
[2] G.A. Seber and A.J. Lee, Linear Regression Analysis. John Wiley & Sons 2012.
[3] S.F. Gibson and B. Mirtich, "A Survey of Deformable Modeling in Computer Graphics," Technical Report TR-97-19, Mitsubishi Electric Research Laboratory, 1997.
[4] R. Tao, X.-Y. Meng, and Y. Wang, "Image Encryption with Multiorders of Fractional Fourier Transforms," IEEE Trans. Information Forensics and Security, vol. 5, no. 4, pp. 734-738, Dec. 2010.
[5] X. Zhang, "Lossy Compression and Iterative Reconstruction for Encrypted Image," IEEE Trans. Information Forensics and Security, vol. 6, no. 1, pp. 53-58, Mar. 2011.
[6] S. Lee, C.D. Yoo, and T. Kalker, "Reversible Image Watermarking Based on Integer-to-Integer Wavelet Transform," IEEE Trans. Information Forensics and Security, vol. 2, no. 3, pp. 321-330, Sept. 2007.
[7] X. Zhang, Z. Qian, Y. Ren, and G. Feng, "Watermarking with Flexible Self-Recovery Quality Based on Compressive Sensing and Compositive Reconstruction," IEEE Trans. Information Forensics and Security, vol. 6, no. 4, pp. 1223-1232, Dec. 2011.
[8] Y. Lindell and B. Pinkas, "Secure Multiparty Computation for Privacy-Preserving Data Mining," J. Privacy and Confidentiality, vol. 1, no. 1,article 5, 2009.
[9] R. Durstenfeld, "Algorithm 235: Random Permutation," Comm. the ACM, vol. 7, no. 7, p. 420, 1964.
[10] D.E. Knuth, The Art of Computer Programming. Addison-Wesley, 2006.
[11] R. Freivalds, "Probabilistic Machines Can Use Less Running Time," Information Processing, vol. 77, pp. 839-842, 1977.
[12] R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge Univ. Press, 1995.
[13] J. Camenisch, S. Hohenberger, and M. Pedersen, "Batch Verification of Short Signatures," Proc. 26th Ann. Int'l Conf. Advances in Cryptology (EUROCRYPT '07), pp. 246-263, 2007.
[14] V. Strassen, "Gaussian Elimination is Not Optimal," Numerische Math., vol. 13, no. 4, pp. 354-356, 1969.
[15] D. Coppersmith and S. Winograd, "Matrix Multiplication via Arithmetic Progressions," J. Symbolic Computation, vol. 9, no. 3, pp. 251-280, 1990.
[16] V.V. Williams, "Breaking the Coppersmith-Winograd Barrier," unpublished manuscript, Nov. 2011.
[17] C.H. Papadimitriou, Computational Complexity. John Wiley & Sons, 2003.
[18] C. Gentry, "A Fully Homomorphic Encryption Scheme," PhD dissertation, Stanford Univ., 2009.
[19] R. Gennaro, C. Gentry, and B. Parno, "Non-Interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers," Proc. 30th Ann. Conf. Advances in Cryptology (CRYPTO '10), pp. 465-482, 2010.
[20] K. Chung, Y. Kalai, and S. Vadhan, "Improved Delegation of Computation Using Fully Homomorphic Encryption," Proc. 30th Ann. Conf. Advances in Cryptology (CRYPTO '10), pp. 483-501, 2010.
[21] D. Benjamin and M.J. Atallah, "Private and Cheating-Free Outsourcing of Algebraic Computations," Proc. Sixth Ann. Conf. Privacy, Security and Trust (PST '08), pp. 240-245, 2008.
[22] M. Atallah and K. Frikken, "Securely Outsourcing Linear Algebra Computations," Proc. Fifth ACM Symp. Information, Computer and Comm. Security, pp. 48-59, 2010.
[23] A. Shamir, "How to Share a Secret," Comm. the ACM, vol. 22, no. 11, pp. 612-613, 1979.
[24] C. Wang, K. Ren, and J. Wang, "Secure and Practical Outsourcing of Linear Programming in Cloud Computing," Proc. IEEE INFOCOM, 2011.
[25] C. Wang, Q. Wang, K. Ren, and J. Wang, "Harnessing the Cloud for Securely Outsourcing Large-Scale Systems of Linear Equations," IEEE Trans. Parallel and Distributed Systems, vol. 24, no. 6, pp. 1172-1181, June 2013.
[26] A. Yao, "Protocols for Secure Computations," Proc. 23rd Ann. Symp. Foundations of Computer Science, pp. 160-164, 1982.
[27] S. Goldwasser, S. Micali, and A. Wigderson, "How to Play Any Mental Game, or a Completeness Theorem for Protocols with an Honest Majority," Proc. 19th Ann. ACM Symp. Theory of Computing, vol. 87, pp. 218-229, 1987.
[28] S. Goldwasser, Y. Kalai, and G. Rothblum, "Delegating Computation: Interactive Proofs for Muggles," Proc. 40th Ann. ACM Symp. Theory of Computing, pp. 113-122, 2008.
[29] T. Matsumoto, K. Kato, and H. Imai, "Speeding Up Secret Computations with Insecure Auxiliary Devices," Proc. Advances in Cryptology (CRYPTO '88), pp. 497-506, 1990.
[30] S. Hohenberger and A. Lysyanskaya, "How to Securely Outsource Cryptographic Computations," Proc. Second Int'l Conf. Theory of Cryptography, pp. 264-282, 2005.
[31] S. Kawamura and A. Shimbo, "Fast Server-Aided Secret Computation Protocols for Modular Exponentiation," IEEE J. Selected Areas in Comm., vol. 11, no. 5, pp. 778-784, June 1993.
55 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool