Efficient Distributed Linear Programming with Limited Disclosure

  • Yuan Hong
  • Jaideep Vaidya
  • Haibing Lu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6818)


In today’s networked world, resource providers and consumers are distributed globally and locally. However, with resource constraints, optimization is necessary to ensure the best possible usage of such scarce resources. Distributed linear programming (DisLP) problems allow collaborative agents to jointly maximize profits (or minimize costs) with a linear objective function while conforming to several shared as well as local linear constraints. Since each agent’s share of the global constraints and the local constraints generally refer to its private limitations or capacities, serious privacy problems may arise if such information is revealed. While there have been some solutions proposed that allow secure computation of such problems, they typically rely on inefficient protocols with enormous communication cost. In this paper, we present a secure and extremely efficient protocol to solve DisLP problems where constraints are arbitrarily partitioned and no variable is shared between agents. In the entire protocol, each agent learns only a partial solution (about its variables), but learns nothing about the private input/output of other agents, assuming semi-honest behavior. We present a rigorous security proof and communication cost analysis for our protocol and experimentally validate the costs, demonstrating its robustness.


  1. 1.
    Turban, E., Rainer, R.K., Potter, R.E.: Introduction to information technology, chapter 2nd, information technologies: Concepts and management, 3rd edn. John Wiley and Sons, ChichesterGoogle Scholar
  2. 2.
    Yokoo, M., Durfee, E.H., Ishida, T., Kuwabar, K.: Distributed constraint satisfaction for formalizing distributed problem solving. In: Proceedings of International Conference on Distributed Computing Systems, pp. 614–621 (1992)Google Scholar
  3. 3.
    Modi, P.J., Shen, W.-M., Tambe, M., Yokoo, M.: An asynchronous complete method for distributed constraint optimization. In: AAMAS 2003: Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 161–168. ACM Press, New York (2003)CrossRefGoogle Scholar
  4. 4.
    Silaghi, M.-C., Rajeshirke, V.: The effect of policies for selecting the solution of a discsp on privacy loss. In: AAMAS 2004: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 1396–1397 (2004)Google Scholar
  5. 5.
    Silaghi, M.C., Mitra, D.: Distributed constraint satisfaction and optimization with privacy enforcement. Iat 00, 531–535 (2004)Google Scholar
  6. 6.
    Suzuki, K., Yokoo, M.: Secure generalized vickrey auction using homomorphic encryption. In: Wright, R.N. (ed.) FC 2003. LNCS, vol. 2742, pp. 239–249. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  7. 7.
    Vaidya, J.: Privacy-preserving linear programming. In: SAC, pp. 2002–2007 (2009)Google Scholar
  8. 8.
    Li, J., Atallah, M.J.: Secure and private collaborative linear programming. In: International Conference on Collaborative Computing: Networking, Applications and Worksharing, CollaborateCom 2006, pp. 1–8 (2006)Google Scholar
  9. 9.
    Vaidya, J.: A secure revised simplex algorithm for privacy-preserving linear programming. In: AINA 2009: Proceedings of the 23rd IEEE International Conference on Advanced Information Networking and Applications (2009)Google Scholar
  10. 10.
    Du, W.: A Study of Several Specific Secure Two-party Computation Problems. PhD thesis, Purdue University, West Lafayette, Indiana (2001)Google Scholar
  11. 11.
    Mangasarian, O.L.: Privacy-preserving linear programming. Optimization Letters 5(1), 28–34 (2010)MathSciNetGoogle Scholar
  12. 12.
    Tebboth, J.R.: A Computational Study of Dantzig-Wolfe Decomposition. PhD thesis, University of Buckingham (2001)Google Scholar
  13. 13.
    Du, W., Atallah, M.J.: Privacy-preserving cooperative scientific computations. In: Proceedings of the 14th IEEE Computer Security Foundations Workshop, pp. 273–282 (2001)Google Scholar
  14. 14.
    Bednarz, A., Bean, N., Roughan, M.: Hiccups on the road to privacy-preserving linear programming. In: Proceedings of the 8th ACM Workshop on Privacy in the Electronic Society, WPES 2009, pp. 117–120. ACM, New York (2009)CrossRefGoogle Scholar
  15. 15.
    Nemhauser, G.L., Wolsey, L.A.: Integer and combinatorial optimization. Wiley-Interscience, New York (1988)MATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2011

Authors and Affiliations

  • Yuan Hong
    • 1
  • Jaideep Vaidya
    • 1
  • Haibing Lu
    • 1
  1. 1.MSIS Department and CIMICRutgers UniversityUSA

Personalised recommendations