Fully privacy-preserving distributed optimization in power systems based on secret sharing

  • Tian N
  • Guo Q
  • Sun H
  • et al.
11Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

With the increasing development of smart grid, multi-party cooperative computation between several entities has become a typical characteristic of modern energy systems. Traditionally, data exchange among parties is inevitable, rendering how to complete multiparty collaborative optimization without exposing any private information a critical issue. This paper proposes a fully privacy-preserving distributed optimization framework based on secure multi-party computation (SMPC) with secret sharing protocols. The framework decomposes the collaborative optimization problem into a master problem and several subproblems. The process of solving the master problem is executed in the SMPC framework via the secret sharing protocols among agents. The relationships of agents are completely equal, and there is no privileged agent or any third party. The process of solving subproblems is conducted by agents individually. Compared to the traditional distributed optimization framework, the proposed SMPC-based framework can fully preserve individual private information. Exchanged data among agents are encrypted and no private information disclosure is assured. Furthermore, the framework maintains a limited and acceptable increase in computational costs while guaranteeing optimality. Case studies are conducted on test systems of different scales to demonstrate the principle of secret sharing and verify the feasibility and scalability of the proposed methodology.

Cite

CITATION STYLE

APA

Tian, N., Guo, Q., Sun, H., & Zhou, X. (2022). Fully privacy-preserving distributed optimization in power systems based on secret sharing. IEnergy, 1(3), 351–362. https://doi.org/10.23919/ien.2022.0045

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free