Privacy-preserving vertically partitioned linear program with nonnegativity constraints

  title={Privacy-preserving vertically partitioned linear program with nonnegativity constraints},
  author={Haohao Li and Zhiyi Tan and Wei Li},
  journal={Optimization Letters},
  • Haohao Li, Z. Tan, Wei Li
  • Published 1 December 2013
  • Computer Science, Mathematics
  • Optimization Letters
We propose a simple privacy-preserving reformulation of a linear program with inequality constraints and nonnegativity constraints. By employing two random matrix transformation we construct a secure linear program based on the privately held data without revealing that data. The secure linear program has the same minimum value as the original linear program. Component groups of the solution of the transformed problem can be decoded and made public only by the original group that owns the… 

A Transformation-Based Multi-Area Dynamic Economic Dispatch Approach for Preserving Information Privacy of Individual Areas

  • Lei Wu
  • Engineering
    IEEE Transactions on Smart Grid
  • 2019
Numerical studies show effectiveness of the proposed approach for guaranteeing the same optimal MA-DED solution, while preserving information privacy of individual areas, and this approach presents significant computational benefits over distributed approaches, especially for multi-area systems with larger numbers of tie-lines and more complicated connection topologies of areas.

Privacy-Friendly Planning of Energy Distribution in Smart Grids

This paper proposes a novel solution that enables the planning of energy distribution in the grid without leaking any information about the energy requests of individual smart meters and implements a prototype based on the proposal.

Chance-constrained OPF: A Distributed Method with Confidentiality Preservation

Given the increased percentage of wind power in power systems, chance-constrained optimal power flow (CC-OPF) calculation, as a means to take wind power uncertainty into account with a guaranteed

Privacy-Preserving Economic Dispatch in Competitive Electricity Market

  • Lei WuJie Li
  • Engineering
    2018 IEEE/PES Transmission and Distribution Conference and Exposition (T&D)
  • 2018
Numerical studies show the effectiveness of the proposed privacy-preserving economic dispatch in competitive electricity market, in which individual generation companies and load serving entities can mask their actual bidding and physical data using random numbers before submitting to the System Operator.



Privacy-preserving horizontally partitioned linear programs

A simple privacy-preserving reformulation of a linear program whose equality constraint matrix is partitioned into groups of rows is proposed, which is transformed into an equivalent one that does not reveal any of the privately held data or make it public.

A Secure Revised Simplex Algorithm for Privacy-Preserving Linear Programming

  • Jaideep Vaidya
  • Computer Science
    2009 International Conference on Advanced Information Networking and Applications
  • 2009
An algorithm based on Revised Simplex is given that ensures that neither party gains access to the other’s private information, which enables collaboration among companies in many domains, enhancing efficiency while maintaining competitiveness.

Privacy-preserving linear programming

This paper proposes a very efficient and secure transformation based solution that has the significant added benefit of being independent of the specific linear programming algorithm used.

Privacy-preserving horizontally partitioned linear programs with inequality constraints

In this paper we solve the open problem, finding the solutions for privacy-preserving horizontally partitioned linear programs with inequality constraints, proposed recently by Mangasarian (Optim

Hiccups on the road to privacy-preserving linear programming

All of the existing transformations in linear programming have a critical flaw, which means that one party can't perform the joint optimization without seeing the secret data of the other parties.

A practical approach to solve Secure Multi-party Computation problems

This work proposes a new paradigm, in which the security is adjustable, such that users can adjust the level of security based on their definition of the acceptable security, and developed a number of techniques under this new paradigm.

Secure and Private Collaborative Linear Programming

  • Jiangtao LiM. Atallah
  • Computer Science
    2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing
  • 2006
An efficient protocol for solving linear programming problems in the honest-but-curious model, such that neither party reveals anything about their private input to the other party (other than what can be inferred from the result).

A study of several specific secure two-party computation problems

This dissertation studies several specific STC problems in the domains of scientific computation, statistical analysis, computational geometry and database query, and explores how domain specific knowledge can improve the efficiency of the solutions that are developed over the generic solutions that do not considerdomain specific knowledge.

The rank of a random matrix