TY - JOUR
T1 - Privacy-Preserving Power System Obfuscation
T2 - A Bilevel Optimization Approach
AU - Mak, Terrence W.K.
AU - Fioretto, Ferdinando
AU - Shi, Lyndon
AU - Van Hentenryck, Pascal
N1 - Funding Information:
Manuscript received May 21, 2019; revised July 23, 2019 and September 15, 2019; accepted September 21, 2019. Date of publication October 2, 2019; date of current version February 26, 2020. This work was supported by the Grid Data Program of Advanced Research Projects Agency (ARPA-E), a United States government agency of Department of Energy, under Grant 1357-1530. Paper no. TPWRS-00711-2019. (Corresponding author: Terrence W. K. Mak.) T. W. K. Mak and P. Van Hentenryck are with the School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332 USA (e-mail: wmak@gatech.edu; pvh@isye.gatech.edu).
Publisher Copyright:
© 1969-2012 IEEE.
PY - 2020/3
Y1 - 2020/3
N2 - This paper considers the problem of releasing optimal power flow (OPF) test cases that preserve the privacy of customers (loads) using the notion of Differential Privacy. It is motivated by the observation that traditional differential privacy algorithms are not suitable for releasing privacy preserving OPF test cases: The added noise fundamentally changes the nature of the underlying optimization and often leads to test cases with no solutions. To remedy this limitation, the paper introduces the OPF Load Indistinguishability (OLI) problem, which guarantees load privacy while satisfying the OPF constraints and remaining close to the optimal dispatch cost. The paper introduces an exact mechanism, based on bilevel optimization, as well as three mechanisms that approximate the OLI problem accurately. These mechanisms enjoy desirable theoretical properties, and the computational experiments show that they produce orders of magnitude improvements over standard approaches on an extensive collection of test cases.
AB - This paper considers the problem of releasing optimal power flow (OPF) test cases that preserve the privacy of customers (loads) using the notion of Differential Privacy. It is motivated by the observation that traditional differential privacy algorithms are not suitable for releasing privacy preserving OPF test cases: The added noise fundamentally changes the nature of the underlying optimization and often leads to test cases with no solutions. To remedy this limitation, the paper introduces the OPF Load Indistinguishability (OLI) problem, which guarantees load privacy while satisfying the OPF constraints and remaining close to the optimal dispatch cost. The paper introduces an exact mechanism, based on bilevel optimization, as well as three mechanisms that approximate the OLI problem accurately. These mechanisms enjoy desirable theoretical properties, and the computational experiments show that they produce orders of magnitude improvements over standard approaches on an extensive collection of test cases.
KW - Data privacy
KW - optimization
KW - power system security
UR - http://www.scopus.com/inward/record.url?scp=85081110427&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85081110427&partnerID=8YFLogxK
U2 - 10.1109/TPWRS.2019.2945069
DO - 10.1109/TPWRS.2019.2945069
M3 - Article
AN - SCOPUS:85081110427
SN - 0885-8950
VL - 35
SP - 1627
EP - 1637
JO - IEEE Transactions on Power Systems
JF - IEEE Transactions on Power Systems
IS - 2
M1 - 8854890
ER -