Privacy-Preserving Cloud Computation of Algebraic Riccati Equations

Surya Malladi, Nima Monshizadeh*

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

We address the problem of securely outsourcing the solution of algebraic Riccati equations (ARE) to a cloud. Our proposed method explores a middle ground between privacy preserving algebraic transformations and perturbation techniques, aiming to achieve simplicity of the former and strong guarantees of the latter. Specifically, we modify the coefficients of the ARE in such a way that the cloud computation on the modified ARE returns the same solution as the original one, which can be then readily used for control purposes. Notably, the approach obviates the need for any algebraic decoding step. We present privacy-preserving algorithms with and without a realizability requirement, which asks for preserving sign-definiteness of certain ARE coefficients in the modified ARE. For the LQR problem, this amounts to ensuring that the modified ARE coefficients can be realized again as an LQR problem for a (dummy) linear system. The algorithm and its computational load is illustrated through a numerical example.

Original languageEnglish
Pages (from-to)223-228
Number of pages6
JournalIEEE Control Systems Letters
Volume8
DOIs
Publication statusPublished - Feb-2024

Keywords

  • Algebraic/geometric methods
  • linear systems
  • optimal control

Cite this