TL;DR
This paper presents a cloud-based protocol for privacy-preserving quadratic optimization using partially homomorphic encryption and secure multi-party computation, balancing privacy and communication efficiency.
Contribution
It introduces a novel cryptographic protocol for distributed quadratic optimization that ensures computational privacy and analyzes its complexity and privacy trade-offs.
Findings
Protocol achieves computational privacy under cryptographic definitions.
A variant reduces communication complexity with weaker privacy guarantees.
Theoretical and implementation results demonstrate effectiveness and efficiency.
Abstract
The development of large-scale distributed control systems has led to the outsourcing of costly computations to cloud-computing platforms, as well as to concerns about privacy of the collected sensitive data. This paper develops a cloud-based protocol for a quadratic optimization problem involving multiple parties, each holding information it seeks to maintain private. The protocol is based on the projected gradient ascent on the Lagrange dual problem and exploits partially homomorphic encryption and secure multi-party computation techniques. Using formal cryptographic definitions of indistinguishability, the protocol is shown to achieve computational privacy, i.e., there is no computationally efficient algorithm that any involved party can employ to obtain private information beyond what can be inferred from the party's inputs and outputs only. In order to reduce the communication…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
