Cloud-based quadratic optimization with partially homomorphic encryption
Cloud-based quadratic optimization with partially homomorphic encryption
This article develops a cloud-based protocol for a constrained quadratic optimization problem involving multiple parties, each holding private data. The protocol is based on the projected gradient ascent on the Lagrange dual problem and exploits partially homomorphic encryption and secure communication techniques. Using formal cryptographic definitions of indistinguishability, the protocol is shown to achieve computational privacy. We show the implementation results of the protocol and discuss its computational and communication complexity. We conclude this article with a discussion on privacy notions.
Cryptography, data privacy, optimization
2357-2364
Alexandru, Andreea B.
bb89f978-d520-4419-85fc-1411fe2df458
Gatsis, Konstantinos
f808d11b-38f1-4a44-ba56-3364d63558d7
Shoukry, Yasser
d4b6131b-8648-4a25-b1fc-8728feb7a69e
Seshia, Sanjit A.
e528d945-b283-4a57-9827-8bf73e6153b5
Tabuada, Paulo
96198e82-9960-4f9c-9fe8-85d534ab469e
Pappas, George J.
24f74ecb-c51f-4ad2-9fa3-20850a5b7821
Alexandru, Andreea B.
bb89f978-d520-4419-85fc-1411fe2df458
Gatsis, Konstantinos
f808d11b-38f1-4a44-ba56-3364d63558d7
Shoukry, Yasser
d4b6131b-8648-4a25-b1fc-8728feb7a69e
Seshia, Sanjit A.
e528d945-b283-4a57-9827-8bf73e6153b5
Tabuada, Paulo
96198e82-9960-4f9c-9fe8-85d534ab469e
Pappas, George J.
24f74ecb-c51f-4ad2-9fa3-20850a5b7821
Alexandru, Andreea B., Gatsis, Konstantinos, Shoukry, Yasser, Seshia, Sanjit A., Tabuada, Paulo and Pappas, George J.
(2020)
Cloud-based quadratic optimization with partially homomorphic encryption.
IEEE Transactions on Automatic Control, 66 (5), , [9130102].
(doi:10.1109/TAC.2020.3005920).
Abstract
This article develops a cloud-based protocol for a constrained quadratic optimization problem involving multiple parties, each holding private data. The protocol is based on the projected gradient ascent on the Lagrange dual problem and exploits partially homomorphic encryption and secure communication techniques. Using formal cryptographic definitions of indistinguishability, the protocol is shown to achieve computational privacy. We show the implementation results of the protocol and discuss its computational and communication complexity. We conclude this article with a discussion on privacy notions.
This record has no associated files available for download.
More information
e-pub ahead of print date: 30 June 2020
Additional Information:
Publisher Copyright:
© 1963-2012 IEEE.
Keywords:
Cryptography, data privacy, optimization
Identifiers
Local EPrints ID: 495164
URI: http://eprints.soton.ac.uk/id/eprint/495164
ISSN: 0018-9286
PURE UUID: f45cd70e-0105-46ce-ba5b-f5244d71b228
Catalogue record
Date deposited: 30 Oct 2024 18:03
Last modified: 31 Oct 2024 03:14
Export record
Altmetrics
Contributors
Author:
Andreea B. Alexandru
Author:
Konstantinos Gatsis
Author:
Yasser Shoukry
Author:
Sanjit A. Seshia
Author:
Paulo Tabuada
Author:
George J. Pappas
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics