Homomorphically encrypted gradient descent algorithms for quadratic programming
Homomorphically encrypted gradient descent algorithms for quadratic programming
In this paper, we evaluate the different fully homomorphic encryption schemes, propose an implementation, and numerically analyze the applicability of gradient descent algorithms to solve quadratic programming in a homomorphic encryption setup. The limit on the multiplication depth of homomorphic encryption circuits is a major challenge for iterative procedures such as gradient descent algorithms. Our analysis not only quantifies these limitations on prototype examples, thus serving as a benchmark for future investigations, but also highlights additional trade-offs like the ones pertaining the choice of gradient descent or accelerated gradient descent methods, opening the road for the use of homomorphic encryption techniques in iterative procedures widely used in optimization based control. In addition, we argue that, among the available homomorphic encryption schemes, the one adopted in this work, namely CKKS, is the only suitable scheme for implementing gradient descent algorithms. The choice of the appropriate step size is crucial to the convergence of the procedure. The paper shows firsthand the feasibility of homomorphically encrypted gradient descent algorithms.
3844-3849
Bertolace, André
0e6ea6ee-b10b-4695-8edb-fbffdecb8d5e
Gatsis, Konstantinos
f808d11b-38f1-4a44-ba56-3364d63558d7
Margellos, Kostas
b40fa8c3-91c0-41e9-b8d6-926ffd9ced45
19 January 2024
Bertolace, André
0e6ea6ee-b10b-4695-8edb-fbffdecb8d5e
Gatsis, Konstantinos
f808d11b-38f1-4a44-ba56-3364d63558d7
Margellos, Kostas
b40fa8c3-91c0-41e9-b8d6-926ffd9ced45
Bertolace, André, Gatsis, Konstantinos and Margellos, Kostas
(2024)
Homomorphically encrypted gradient descent algorithms for quadratic programming.
In Proceedings of the 62nd IEEE Conference on Decision and Control.
.
(doi:10.1109/CDC49753.2023.10383503).
Record type:
Conference or Workshop Item
(Paper)
Abstract
In this paper, we evaluate the different fully homomorphic encryption schemes, propose an implementation, and numerically analyze the applicability of gradient descent algorithms to solve quadratic programming in a homomorphic encryption setup. The limit on the multiplication depth of homomorphic encryption circuits is a major challenge for iterative procedures such as gradient descent algorithms. Our analysis not only quantifies these limitations on prototype examples, thus serving as a benchmark for future investigations, but also highlights additional trade-offs like the ones pertaining the choice of gradient descent or accelerated gradient descent methods, opening the road for the use of homomorphic encryption techniques in iterative procedures widely used in optimization based control. In addition, we argue that, among the available homomorphic encryption schemes, the one adopted in this work, namely CKKS, is the only suitable scheme for implementing gradient descent algorithms. The choice of the appropriate step size is crucial to the convergence of the procedure. The paper shows firsthand the feasibility of homomorphically encrypted gradient descent algorithms.
This record has no associated files available for download.
More information
Published date: 19 January 2024
Identifiers
Local EPrints ID: 494561
URI: http://eprints.soton.ac.uk/id/eprint/494561
PURE UUID: 2964f26c-26d8-4bfa-8166-63bcc44241f7
Catalogue record
Date deposited: 10 Oct 2024 16:46
Last modified: 11 Oct 2024 02:08
Export record
Altmetrics
Contributors
Author:
André Bertolace
Author:
Konstantinos Gatsis
Author:
Kostas Margellos
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