Efficient and verifiable algorithm for secure outsourcing of large-scale linear programming

Proceedings - International Conference on Advanced Information Networking and Applications, AINA

Volumn , Issue , 2014, Pages 591-596

  Nie, Haixin ^a   Chen, Xiaofeng ^a   Li, Jin ^b   Liu, Josolph ^c   Lou, Wenjing ^d  

^a XIDIAN UNIVERSITY   (China)

^b GUANGZHOU UNIVERSITY   (China)

^c INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^d VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

Cloud computing; Data secrecy; Linear programming; Outsource secure algorithms

Indexed keywords

CLOUD COMPUTING; FINANCIAL DATA PROCESSING; INFORMATION MANAGEMENT; LINEAR PROGRAMMING; OUTSOURCING;

COMPUTATIONAL OVERHEADS; DATA SECRECY; ENGINEERING APPLICATIONS; NETWORK FLOW PROBLEMS; PORTFOLIO OPTIMIZATION; RESOURCE-CONSTRAINT DEVICES; SCIENTIFIC COMMUNITY; STATE-OF-THE-ART ALGORITHMS;

ALGORITHMS;

EID: 84903852537     PISSN: 1550445X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AINA.2014.147     Document Type: Conference Paper

References (31)

1. G. Cohen, Auxiliary problem principle and decomposition optimization problems, Journal of Optimizatin Theory and Appilications, 32(3), pp. 277-305, 1980.
2. MJ. 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.
3. M. Atallah and K. Frikken, Securely outsourcing linear algebra computations Proc. of ASIACCS, pp. 48-59, 2010.
4. D. Benjamin and M. J. Atallah, Private and cheating-free outsourcing of algebraic computations, Proc. of 6th Conf. on Privacy, Security, and Trust (PST), pp. 240-245, 2008.
5. M. Abadi, J. Feigenbaum, and J. Kilian, On hiding information from an oracle, Proc. of the 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 195-203, 1987.
6. M. Blanton, Improved conditional e-payments, ACNS 2008, LNCS 5037, Springer-Verlag, pp. 188-206, 2008.
7. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway, Locally random reductions: Improvements and applications, Journal of Cryptology, 10(1), pp. 17-36, 1997.
8. S. Benabbas, R. Gennaro, and Y. Vahlis, Verifiable delegation of computation over large datasets, Advances in Cryptology-Crypto 2011, LNCS 6841, Springer-Verlag, pp. 111-131, 2011.
9. X. Chen, J. Li, and W. Susilo, Efficient Fair Conditional Payments for Outsourcing Computations, IEEE Transactions on Information Forensics and Security, 7(6), pp. 1687-1694, 2012.
10. X. Chen, J. Li, J. Ma, Q. Tang, and W. Lou, New algorithms for secure outsourcing of modular exponentiations, ESORICS 2012, LNCS 7459, pp. 541-556, Springer-Verlag, 2012.
11. D. Chaum and T. Pedersen, Wallet databases with observers, Advances in Cryptology-Crypto 1992, LNCS 740, Springer-Verlag, pp. 89-105, 1993.
12. R. Canetti, B. Riva, G. Rothblum, Practical delegation of computation using multiple servers, Proc. of the 18th ACM Conference on Computer and Communications Security (CCS), pp. 445-454, 2011.
13. M. Green, S. Hohenberger, B. Waters, Outsourcing the Decryption of ABE Ciphertexts, Proc. of the 20th USENIX conference on Security, 2011.
14. J. Dreier and F. Kerschbaum, Practical secure and efficient multiparty linear programming based on problem transformation. IACR Cryptology ePrint Archive 2011/108, 2011.
15. M. Girault and D. Lefranc, Server-aided verification: theory and practice, Advances in Cryptology-ASIACRYPT 2005, LNCS 3788, Springer-Verlag, pp. 605-623, 2005.
16. P. Golle, I. Mironov, Uncheatable distributed computations, CT-RSA 2001, LNCS 2020, Springer-Verlag, pp. 425-440, 2001
17. O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game, Proc. of the 19th Symp. on the Theory of Comp., pp. 218-229, 1987.
18. R. Gennaro, C. Gentry, and B. Parno, Non-interactive verifiable computing: Outsourcing computation to untrusted workers, Advances in Cryptology-Crypto 2010, LNCS 6223, Springer-Verlag, pp. 465-482, 2010.
19. S. Hohenberger and A. Lysyanskaya, How to securely outsource cryptographic computations, TCC 2005, LNCS 3378, Springer Verlag, pp. 264-282, 2005.
20. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed., MIT press, 2008.
21. P. Laud, A. Pankova, On the (Im)possibility of Privately Outsourcing Linear Programming, Proceedings of the 2013 ACM workshop on Cloud computing security workshop (CCSW 13), pp. 55-64, 2013.
22. D. Luenberger and Y. Ye, Linear and Nonlinear Programming, 3rd ed., Springer, 2008.
23. M. Blanton, M.J. Atallah. Algorithms and Theory of Computation Handbook, CRC Press, contents 6-13, 1999.
24. R. Mansini, W. Ogryczak, M.G. Speranza, Conditional value at risk and related linear programming models for portfolio optimization, Annals of Operations Research, 152(1), Springer, pp. 227-256, 2007.
25. PQ. Nguyen, I.E. Shparlinski, and J. Stern, Distribution of modular sums and the security of server aided exponentiation, Proc. of the Workshop on Comp. Number Theory and Crypt., pp. 1-16, 1999.
26. B. Parno, M. Raykova and V Vaikuntanathan, How to delegate and verify in public: verifiable computation from attribute-based encryption, TCC 2012, LNCS 7194, Springer-Verlag, pp. 422-439, 2012.
27. C. P. Schnorr, Efficient signature generation for smart cards, Journal of Cryptology, 4(3), pp. 239-252, Springer-Verlag, 1991.
28. L. Shi, B. Carbunar, and R. Sion, Conditional E-cash, FC 2007, LNCS 4886, Springer-Verlag, pp. 15-28, 2007.
29. C. Wang, K. Ren, J. Wang, and Qian Wang, Harnessing the Cloud for Securely Outsourcing Large-scale Systems of Linear Equations, IEEE Trans. Parallel Distribution Systems, 24(6), pp. 1172-1181, 2013.
30. this paper is presented at the 31th International Conference on Distributed Computing Systems (ICDCS), pp. 820-828, 2011.
31. C. Wang, K. Ren, and J. Wang, Secure and practical outsourcing of linear programming in cloud computing, Proc. of the 30th IEEE International Conference on Computer Communications (INFOCOM), pp. 820-828, 2011.