Practical Secure and Efficient Multiparty Linear Programming Based on Problem Transformation

Cryptographic solutions to privacy-preserving multiparty linear programming are slow. This makes them unsuitable for many economically important applications, such as supply chain optimization, whose size exceeds their practically feasible input range. In this paper we present a privacy-preserving transformation that allows secure out-sourcing of the linear program computation in an efficient manner. We evaluate security by quantifying the leakage about the input after the transformation and present implementation results. Using this transformation , we can mostly replace the costly cryptographic operations and securely solve problems several orders of magnitude larger