Name
Abstract | ||
|---|---|---|
This paper studies how a system operator and a set of agents securely execute a distributed projected gradient-based algorithm. In particular, each participant holds a set of problem coefficients and/or states whose values are private to the data owner. The concerned problem raises two questions: how to securely compute given functions; and which functions should be computed in the first place. For the first question, by using the techniques of homomorphic encryption, we propose novel algorithms which can achieve secure multiparty computation with perfect correctness. For the second question, we identify a class of functions which can be securely computed. The correctness and computational efficiency of the proposed algorithms are verified by two case studies of power systems, one on a demand response problem and the other on an optimal power flow problem. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.automatica.2018.07.005 | Automatica |
Keywords | DocType | Volume |
Distributed optimization,Privacy,Homomorphic encryption | Journal | 96 |
Issue | ISSN | Citations |
96 | 0005-1098 | 9 |
PageRank | References | Authors |
0.49 | 17 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yang Lu | 1 | 183 | 50.38 |
| Minghui Zhu | 2 | 44 | 12.11 |