On the (Im)possibility of privately outsourcing linear programming

Authors:
Peeter Laud;Alisa Pankova
Affiliations:
Cybernetica AS, Tartu, Estonia;Cybernetica AS, Tartu, Estonia
Venue:
Proceedings of the 2013 ACM workshop on Cloud computing security workshop
Year:
2013

Citing 10
Cited 0

A practical approach to solve Secure Multi-party Computation problems

Proceedings of the 2002 workshop on New security paradigms
A study of several specific secure two-party computation problems

A study of several specific secure two-party computation problems
Secure outsourcing of sequence comparisons

International Journal of Information Security - Special issue on SC 2003
Privacy-preserving linear programming

Proceedings of the 2009 ACM symposium on Applied Computing
Solving Linear Programs Using Multiparty Computation

Financial Cryptography and Data Security
Hiccups on the road to privacy-preserving linear programming

Proceedings of the 8th ACM workshop on Privacy in the electronic society
Securely outsourcing linear algebra computations

ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
How to securely outsource cryptographic computations

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Foundations of garbled circuits

Proceedings of the 2012 ACM conference on Computer and communications security
Encryption techniques for secure database outsourcing

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the security definitions and methods for transformation-based outsourcing of linear programming. The recent attacks have shown the deficiencies of existing security definitions; thus we propose a stronger, indistinguishability-based definition of security of problem transformations that is very similar to IND-CPA security of encryption systems. We will study the realizability of this definition for linear programming and find that barring radically new ideas, there cannot exist transformations that are secure information-theoretically or even computationally. We conclude that for solving linear programming problems in privacy-preserving manner, cryptographic methods for securely implementing Simplex or some other linear programming solving algorithm are the only viable approach.