Linear programming: methods and applications (5th ed.)
Linear programming: methods and applications (5th ed.)
An efficient probabilistic public key encryption scheme which hides all partial information
Proceedings of CRYPTO 84 on Advances in cryptology
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Secret sharing homomorphisms: keeping shares of a secret secret
Proceedings on Advances in cryptology---CRYPTO '86
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Linear programming without the matrix
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A new public key cryptosystem based on higher residues
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Privacy-Preserving Cooperative Scientific Computations
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A study of several specific secure two-party computation problems
A study of several specific secure two-party computation problems
The Effect of Policies for Selecting the Solution of a DisCSP on Privacy Loss
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Distributed Constraint Satisfaction and Optimization with Privacy Enforcement
IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
On private scalar product computation for privacy-preserving data mining
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Impossibility of unconditionally secure scalar products
Data & Knowledge Engineering
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
On the (Im)possibility of privately outsourcing linear programming
Proceedings of the 2013 ACM workshop on Cloud computing security workshop
Secure and efficient distributed linear programming
Journal of Computer Security - DBSec 2011
| Hi-index | 0.01 |
With the rapid increase in computing, storage and networking resources, data is not only collected and stored, but also analyzed. This creates a serious privacy problem which often inhibits the use of this data. In this paper, we focus on the problem of linear programming, which is the most important sub-class of optimization problems. We consider the case where the objective function and the constraints are partitioned between two parties with one party holding the objective while the other holds the constraints. We propose a very efficient and secure transformation based solution that has the significant added benefit of being independent of the specific linear programming algorithm used.