A Secure Revised Simplex Algorithm for Privacy-Preserving Linear Programming

Authors:
Jaideep Vaidya
Affiliations:
-
Venue:
AINA '09 Proceedings of the 2009 International Conference on Advanced Information Networking and Applications
Year:
2009

Citing 0
Cited 4

Hiccups on the road to privacy-preserving linear programming

Proceedings of the 8th ACM workshop on Privacy in the electronic society
Efficient distributed linear programming with limited disclosure

DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud

Journal of Parallel and Distributed Computing
Secure and efficient distributed linear programming

Journal of Computer Security - DBSec 2011

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear programming is one of the most widely applied solutions to optimization problems. This paper presents a privacy-preserving solution to linear programming for two parties when the cost, or objective, function is known only to one party, and the constraint equations are known only to the other party. An algorithm based on Revised Simplex is given that ensures that neither party gains access to the other’s private information. While this has been proposed before, our solution is significantly more efficient for the given data distribution. This enables collaboration among companies in many domains, enhancing efficiency while maintaining competitiveness.