Privacy-preserving linear programming

Document Type


Date of Original Version



With the rapid increase in computing, storage, and networking resources, data are not only collected and stored, but also analyzed. This creates a serious privacy problem which often inhibits the use of this data. In this chapter, we investigate and resolve the privacy issues in a fundamental optimization problem - Linear Programming (LP) which is formulated by data collected from different parties. We first consider the case where the objective function and constraints of the LP problem are not partitioned between two parties where one party privately holds the objective function while the other party privately holds the constraints. Second, we present a privacy-preserving technique for the case that objective function and constraints are arbitrarily partitioned between two parties where each party privately holds a share of objective function and constraints. Finally, we extend the technique for securely solving two-party arbitrarily partitioned LP problems to a multi-party scenario. In summary, we propose a set of efficient and secure transformation-based techniques that create significant value-added benefits of being independent of the specific algorithms used for solving the LP problem.

Publication Title, e.g., Journal

World Scientific Reference On Innovation