Privacy-aware quadratic optimization using partially homomorphic encryption

We consider a problem where multiple agents participate in solving a quadratic optimization problem subject to linear inequality constraints in a privacy-preserving manner. Several variables of the objective function as well as the constraints are privacy-sensitive and are known to different agents....

Full description

Saved in:
Bibliographic Details
Published in2016 IEEE 55th Conference on Decision and Control (CDC) pp. 5053 - 5058
Main Authors Shoukry, Yasser, Gatsis, Konstantinos, Alanwar, Amr, Pappas, George J., Seshia, Sanjit A., Srivastava, Mani, Tabuada, Paulo
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2016
Subjects
Convex functions
Data privacy
Encryption
Optimization
Privacy
Protocols
Online AccessGet full text
DOI10.1109/CDC.2016.7799042

Cover

More Information
Summary:We consider a problem where multiple agents participate in solving a quadratic optimization problem subject to linear inequality constraints in a privacy-preserving manner. Several variables of the objective function as well as the constraints are privacy-sensitive and are known to different agents. We propose a privacy-preserving protocol based on partially homomorphic encryption where each agent encrypts its own information before sending it to an untrusted cloud computing infrastructure. To find the optimal solution the cloud applies a gradient descent algorithm on the encrypted data without the ability to decrypt it. The privacy of the proposed protocol against coalitions of colluding agents is analyzed using the cryptography notion of zero knowledge proofs.
DOI:10.1109/CDC.2016.7799042