Secure and efficient distributed linear programming

Journal of Computer Security

Volumn 20, Issue 5, 2012, Pages 583-634

  Hong, Yuan ^a   Vaidya, Jaideep ^a   Lu, Haibing ^b  

^a RUTGERS UNIVERSITY   (United States)

^b SANTA CLARA UNIVERSITY   (United States)

Author keywords

Distributed linear programming; efficiency; security; transformation

Indexed keywords

ADVERSARY MODELS; COLLABORATIVE AGENTS; COLUMN GENERATION; COMMUNICATION COST; COMPUTING ENVIRONMENTS; COST ANALYSIS; DISTRIBUTED AGENTS; GLOBAL CONSTRAINTS; INCENTIVE COMPATIBLE; LINEAR OBJECTIVE FUNCTIONS; LOCAL CONSTRAINTS; LOCAL LINEAR; MALICIOUS BEHAVIOR; PRIVACY PROBLEMS; PRIVATE INFORMATION; RESOURCE CONSTRAINT; RESOURCE PROVIDERS; SCARCE RESOURCES; SECURE COMPUTATION; SECURITY; SECURITY ANALYSIS; TRANSFORMATION;

COMPUTER SYSTEMS; COST ACCOUNTING; EFFICIENCY; LINEAR PROGRAMMING; PROFITABILITY;

MATHEMATICAL TRANSFORMATIONS;

EID: 84872255959     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2012-0452     Document Type: Conference Paper

References (45)

1. M.J. Atallah, V. Deshpande, H.G. Elmongui and L.B. Schwarz, Secure supply-chain protocols, in: Proceedings of the 2003 IEEE International Conference on E-Commerce, Newport Beach, CA, June 24-27, 2003, pp. 293-302.
2. B. Awerbuch and Y. Azar, Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation, in: Proc. IEEE Symposium on Foundations of Computer Science, 1994, pp. 240-249.
3. Y. Bartal, J.W. Byers and D. Raz, Fast, distributed approximation algorithms for positive linear programming with applications to flow control, SIAM J. Comput. 33(6) (2004), 1261-1279. (Pubitemid 40026766)
4. A. Bednarz, N. Bean and M. Roughan, Hiccups on the road to privacy-preserving linear programming, in: Proceedings of the 8th ACM Workshop on Privacy in the Electronic Society, ACM, New York, NY, USA, 2009, pp. 117-120.
5. O. Catrina and S. de Hoogh, Secure multiparty linear programming using fixed-point arithmetic, in: ESORICS, 2010, pp. 134-150.
6. C. Clifton, A. Iyer, R. Cho, W. Jiang, M. Kantarcioglu and J. Vaidya, An approach to identifying beneficial collaboration securely in decentralized logistics systems, Manufacturing & Service Operations Management 10(1) (2008), 108-125.
7. G. Dantzig, Linear Programming and Extensions, Princeton Univ. Press, Princeton, NJ, USA, 1963.
8. X. Deng and C.H. Papadimitriou, Distributed decision-making with incomplete information, in: Proceedings of the 12th IFIP Congress, Madrid, 1992.
9. W. Du, A study of several specific secure two-party computation problems, PhD thesis, Purdue University, West Lafayette, IN, USA, 2001.
10. W. Du and M.J. Atallah, Privacy-preserving cooperative scientific computations, in: Proceedings of the 14th IEEE Computer Security Foundations Workshop, 2001, pp. 273-282. (Pubitemid 32882591)
11. X. Feng and Z. Zhang, The rank of a random matrix, Appl. Math. Comput. 185(1) (2007), 689-694. (Pubitemid 46241400)
12. J.N. Franklin, Matrix Theory, Dover, New York, USA, 2000.
13. H. Gintis, Game Theory Evolving: A Problem-Centered Introduction to Modeling Strategic Interaction, Princeton Univ. Press, Princeton, NJ, USA, 2009.
14. O. Goldreich, The Foundations of Cryptography, Cambridge Univ. Press, Cambridge, 2004.
15. O. Goldreich, S. Micali and A. Wigderson, How to play any mental game-a completeness theorem for protocols with honest majority, in: Proceedings of the 19th ACM Symposium on the Theory of Computing, ACM, New York, NY, USA, 1987, pp. 218-229. (Pubitemid 18643409)
16. Y. Hong, J. Vaidya and H. Lu, Efficient distributed linear programming with limited disclosure, in: DBSec, 2011, pp. 170-185.
17. Y. Hong, J. Vaidya, H. Lu and B. Shafiq, Privacy-preserving tabu search for distributed graph coloring, in: SocialCom/PASSAT, 2011, pp. 951-958.
18. S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220(4598) (1983), 671-680.
19. J. Li and M.J. Atallah, Secure and private collaborative linear programming, in: Proc. International Conference on Collaborative Computing: Networking, Applications and Worksharing, 2006, pp. 1-8.
20. W. Li, H. Li and C. Deng, Privacy-preserving horizontally partitioned linear programs with inequality constraints, Optim. Lett. (2011), DOI: 10.1007/s11590-011-0403-2.
21. R. Mailler and V. Lesser, Solving distributed constraint optimization problems using cooperative mediation, in: Proceedings of 3rd International Joint Conference on Autonomous Agents and Multiagent Systems, IEEE Computer Society, Los Alamitos, CA, USA, 2004, pp. 438-445.
22. O.L. Mangasarian, Privacy-preserving linear programming, Optim. Lett. 5(1) (2011), 165-172.
23. O.L. Mangasarian, Privacy-preserving horizontally partitioned linear programs, Optim. Lett. 6(3) (2012), 431-436.
24. P.J. Modi, W.-M. Shen, M. Tambe and M. Yokoo, An asynchronous complete method for distributed constraint optimization, in: Proceedings of the 2nd International Joint Conference on Autonomous Agents and Multiagent Systems, ACM Press, New York, NY, USA, 2003, pp. 161-168.
25. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, NY, USA, 1988.
26. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Upper Saddle River, NJ, USA, 1982.
27. C.H. Papadimitriou and M. Yannakakis, On the value of information in distributed decision-making (extended abstract), in: Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, ACM Press, New York, NY, USA, 1991, pp. 61-64.
28. C.H. Papadimitriou and M. Yannakakis, Linear programming without the matrix, in: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, ACM Press, New York, NY, USA, 1993, pp. 121-129.
29. A. Petcu and B. Faltings, A scalable method for multiagent constraint optimization, in: Proceedings of the 19th International Joint Conference on Artificial Intelligence, 2005, pp. 266-271.
30. A. Petcu and B. Faltings, Superstabilizing, fault-containing multiagent combinatorial optimization, in: Proceedings of the National Conference on Artificial Intelligence, 2005, pp. 449-454. (Pubitemid 43006816)
31. A. Petcu and B. Faltings, Approximations in distributed optimization, in: Proc. Workshop on Distributed and Speculative Constraint Processing, 2005, pp. 802-806.
32. J. Sakuma and S. Kobayashi, A genetic algorithm for privacy preserving combinatorial optimization, in: GECCO, 2007, pp. 1372-1379. (Pubitemid 47291705)
33. M.-C. Silaghi, B. Faltings and A. Petcu, Secure combinatorial optimization simulating DFS tree-based variable elimination, in: Proc. 9th Symposium on Artificial Intelligence and Mathematics, Ft. Lauderdale, FL, USA, January 2006, available at: http://www2.cs.fit.edu/msilaghi/papers/.
34. M.-C. Silaghi and V. Rajeshirke, The effect of policies for selecting the solution of a disCSP on privacy loss, in: Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems, 2004, pp. 1396-1397.
35. M.-C. Silaghi and D. Mitra, Distributed constraint satisfaction and optimization with privacy enforcement, in: Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, Beijing, 2004, pp. 531-535. (Pubitemid 40456747)
36. K. Suzuki and M. Yokoo, Secure generalized Vickrey auction using homomorphic encryption, in: Proceedings of the 7th Annual Conference on Financial Cryptography, Lecture Notes in Computer Science, Vol. 2742, Springer, Heidelberg, 2003, pp. 239-249.
37. J.R. Tebboth, A computational study of Dantzig-Wolfe decomposition, PhD thesis, University of Buckingham, 2001.
38. E. Turban, R.K. Rainer and R.E. Potter, Introduction to Information Technology, 3rd edn, Wiley, New York, NY, USA, 2005.
39. J. Vaidya, Privacy-preserving linear programming, in: SAC, 2009, pp. 2002-2007.
40. J. Vaidya, A secure revised simplex algorithm for privacy-preserving linear programming, in: Proceedings of the 23rd IEEE International Conference on Advanced Information Networking and Applications, 2009, pp. 347-354.
41. A.C. Yao, How to generate and exchange secrets, in: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, USA, 1986, pp. 162-167.
42. M. Yokoo, E.H. Durfee, T. Ishida and K. Kuwabar, Distributed constraint satisfaction for formalizing distributed problem solving, in: Proceedings of International Conference on Distributed Computing Systems, 1992, pp. 614-621.
43. M. Yokoo and K. Hirayama, Distributed breakout algorithm for solving distributed constraint satisfaction problems, in: Proceedings of the 1st International Conference on Multi-Agent Systems, V. Lesser, ed., MIT Press, Cambridge, MA, USA, 1995, p. 467.
44. M. Yokoo, K. Suzuki and K. Hirayama, Secure distributed constraint satisfaction: reaching agreement without revealing private information, in: Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, Springer-Verlag, London, UK, 2002, pp. 387-401.
45. W. Zhang and L. Wittenburg, Distributed breakout algorithm for distributed constraint optimization problems-dbarelax, in: Proceedings of the International Joint Conference on Autonomous Agents and Multi Agent Systems, 2003, pp. 185-192.