Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Robust and Nonlinear Control

Encrypted polynomial control based on tailored two‐party computation

Moritz Schulze Darup

Published May 18, 2020• 21 citations
Publisher

Abstract

Summary Encrypted control enables confidential controller evaluations in cloud‐based or networked control systems. Roughly speaking, an encrypted controller is a modified control algorithms that is capable of computing encrypted control actions based on encrypted system states. Encrypted control has been realized using different tools from cryptography such as homomorphic encryption, secret sharing, and multiparty computation. However, the vast majority of existing encrypted controllers is linear or makes intensive use of encrypted linear operations. In this article, we present a novel and flexible method for the encrypted implementation of arbitrary polynomial controllers. Technically, our approach builds on tailored two‐party computation combined with secret sharing and additively homomorphic encryption.

DOI
10.1002/rnc.5003

Related papers

Multi-party computation for secure polynomial control.

Sebastian Schlor, Michael Hertneck, Stefan Wildhagen +1 more

Encrypted control systems allow to evaluate feedback laws on external servers without revealing private information about state and input data, the control law, or the plant. While there are a number of encrypted control schemes available for linear feedback laws, only few results exist for the evaluation of more general control laws. Recently, an approach to encrypted polynomial control was presented, relying on two-party secret sharing and an inter-server communication protocol using homomorphic encryption. As homomorphic encryptions are much more computationally demanding than secret sharing, they make up for a tremendous amount of the overall computational demand of this scheme. For this reason, in this paper, we investigate schemes for secure polynomial control based solely on secret sharing. We introduce a novel secure three-party control scheme based on three-party computation. Further, we propose a novel $n$-party control scheme to securely evaluate polynomial feedback laws of arbitrary degree without inter-server communication. The latter property makes it easier to realize the necessary requirement regarding non-collusion of the servers, with which perfect security can be guaranteed. Simulations suggest that the presented control schemes are many times less computationally demanding than the two-party scheme mentioned above.

•Mar 30, 2021•0 citations

Multi-party computation enables secure polynomial control based solely on secret-sharing

Sebastian Schlor, Michael Hertneck, Stefan Wildhagen +1 more

Encrypted control systems allow to evaluate feedback laws on external servers without revealing private information about state and input data, the control law, or the plant. While there are a number of encrypted control schemes available for linear feedback laws, only few results exist for the evaluation of more general control laws. Recently, an approach to encrypted polynomial control was presented, relying on two-party secret sharing and an inter-server communication protocol using homomorphic encryption. As homomorphic encryptions are much more computationally demanding than secret sharing, they make up for a tremendous amount of the overall computational demand of this scheme. For this reason, in this paper, we demonstrate that multi-party computation enables secure polynomial control based solely on secret sharing. We introduce a novel secure three-party control scheme based on three-party computation. Further, we propose a novel n-party control scheme to securely evaluate polynomial feedback laws of arbitrary degree without inter-server communication. The latter property makes it easier to realize the necessary requirement regarding non-collusion of the servers, with which perfect security can be guaranteed. Simulations suggest that the presented control schemes are many times less computationally demanding than the two-party scheme mentioned above.

arXiv:2103.16335•IEEE Conference on Decision and Control (CDC)•Dec 14, 2021•18 citations

Experimental Examination of Secure Two-Party Controller Computation

Kaoru Teranishi, Jihoon Suh, Takashi Tanaka

A secure two-party computation protocol for running dynamic controllers over secret sharing has recently been proposed. Unlike encrypted control schemes based on homomorphic encryption, this protocol enables operating dynamic controllers for an infinite time horizon without controller-state decryption, controller-state reset, or input re-encryption. However, the two-party setting introduces additional online communication between the computing parties, which may hinder real-time feasibility. In this study, we demonstrate the feasibility of the protocol through implementation on a commercial cloud platform with an inverted pendulum testbed. Experimental results show that the proposed protocol successfully stabilized the pendulum despite the online communication overhead.

arXiv:2605.11443•May 12, 2026•0 citations

Encrypted LQG using labeled homomorphic encryption

Andreea B. Alexandru, George J. Pappas

We consider the problem of implementing a Linear Quadratic Gaussian (LQG) controller on a distributed system, while maintaining the privacy of the measurements, state estimates, control inputs and system model. The component sub-systems and actuator outsource the LQG computation to a cloud controller and encrypt their signals and matrices. The encryption scheme used is Labeled Homomorphic Encryption, which supports the evaluation of degree-2 polynomials on encrypted data, by attaching a unique label to each piece of data and using the fact that the outsourced computation is known by the actuator. We write the state estimate update and control computation as multivariate polynomials in the encrypted data and propose an extension to the Labeled Homomorphic Encryption scheme that achieves the evaluation of low-degree polynomials on encrypted data, with degree larger than two. We showcase the numerical results of the proposed protocol for a temperature control application that indicates competitive online times.

ACM/IEEE International Conference on Cyber-Physical Systems (ICCPS)•Apr 4, 2019•27 citations

Further Methods for Encrypted Linear Dynamic Controllers Utilizing Re-Encryption

Junsoo Kim

Homomorphic encryption (HE) applied to a networked controller enables secure operation, but in most cases it allows for addition and multiplication over integers only, because of computation efficiency. Several related results deal with such constraints by means of re-encrypted controller output, based on which the controller can be re-constructed and operate over integers. This paper presents two modified methods based on the output re-encryption, which will further reduce the required communication effort and computational burden, respectively.

arXiv:2307.16445•IEEE Transactions on Automatic Control•Apr 10, 2024•7 citations

Guidelines for Secure Process Control: Harnessing the Power of Homomorphic Encryption and State Feedback Control

Matúš Furka, Martin Kalúz, Miroslav Fikar +1 more

The paper presents applications of homomorphic cryptographic schemes in process control. Homomorphic encryption is a particular type of encryption that allows performing mathematical operations over encrypted data. Therefore the user can use third-party services as controllers without revealing any vulnerable information, like process data. Homomorphic properties make it possible to perform data aggregation or evaluate control actions without having any knowledge about the process data. Our paper explores two fully homomorphic cryptographic schemes, namely Brakerski/Fan-Vercauteren (BFV) and Cheon-Kim-Kim-Song (CKKS) cryptosystems. Each scheme is briefly described with its advantages and drawbacks, conditions, and applications. We present a case study involving linear-quadratic (LQ) control strategy implemented in an encrypted setup. This serves for comparison and a step-by-step guide for implementing encrypted process control.

IEEE Access•Jan 1, 2023•6 citations
Summary Encrypted control enables confidential controller evaluations in cloud‐based or networked control systems. Roughly speaking, an encrypted controller is a modified control algorithms that is capable of computing encrypted control actions based on encrypted system states. Encrypted control has been realized using different tools from cryptography such as homomorphic encryption, secret sharing, and multiparty computation. However, the vast majority of existing encrypted controllers is linear or makes intensive use of encrypted linear operations. In this article, we present a novel and flexible method for the encrypted implementation of arbitrary polynomial controllers. Technically, our approach builds on tailored two‐party computation combined with secret sharing and additively homomorphic encryption.
Encrypted control systems allow to evaluate feedback laws on external servers without revealing private information about state and input data, the control law, or the plant. While there are a number of encrypted control schemes available for linear feedback laws, only few results exist for the evaluation of more general control laws. Recently, an approach to encrypted polynomial control was presented, relying on two-party secret sharing and an inter-server communication protocol using homomorphic encryption. As homomorphic encryptions are much more computationally demanding than secret sharing, they make up for a tremendous amount of the overall computational demand of this scheme. For this reason, in this paper, we investigate schemes for secure polynomial control based solely on secret sharing. We introduce a novel secure three-party control scheme based on three-party computation. Further, we propose a novel nnn-party control scheme to securely evaluate polynomial feedback laws of arbitrary degree without inter-server communication. The latter property makes it easier to realize the necessary requirement regarding non-collusion of the servers, with which perfect security can be guaranteed. Simulations suggest that the presented control schemes are many times less computationally demanding than the two-party scheme mentioned above.
Encrypted control systems allow to evaluate feedback laws on external servers without revealing private information about state and input data, the control law, or the plant. While there are a number of encrypted control schemes available for linear feedback laws, only few results exist for the evaluation of more general control laws. Recently, an approach to encrypted polynomial control was presented, relying on two-party secret sharing and an inter-server communication protocol using homomorphic encryption. As homomorphic encryptions are much more computationally demanding than secret sharing, they make up for a tremendous amount of the overall computational demand of this scheme. For this reason, in this paper, we demonstrate that multi-party computation enables secure polynomial control based solely on secret sharing. We introduce a novel secure three-party control scheme based on three-party computation. Further, we propose a novel n-party control scheme to securely evaluate polynomial feedback laws of arbitrary degree without inter-server communication. The latter property makes it easier to realize the necessary requirement regarding non-collusion of the servers, with which perfect security can be guaranteed. Simulations suggest that the presented control schemes are many times less computationally demanding than the two-party scheme mentioned above.
A secure two-party computation protocol for running dynamic controllers over secret sharing has recently been proposed. Unlike encrypted control schemes based on homomorphic encryption, this protocol enables operating dynamic controllers for an infinite time horizon without controller-state decryption, controller-state reset, or input re-encryption. However, the two-party setting introduces additional online communication between the computing parties, which may hinder real-time feasibility. In this study, we demonstrate the feasibility of the protocol through implementation on a commercial cloud platform with an inverted pendulum testbed. Experimental results show that the proposed protocol successfully stabilized the pendulum despite the online communication overhead.
We consider the problem of implementing a Linear Quadratic Gaussian (LQG) controller on a distributed system, while maintaining the privacy of the measurements, state estimates, control inputs and system model. The component sub-systems and actuator outsource the LQG computation to a cloud controller and encrypt their signals and matrices. The encryption scheme used is Labeled Homomorphic Encryption, which supports the evaluation of degree-2 polynomials on encrypted data, by attaching a unique label to each piece of data and using the fact that the outsourced computation is known by the actuator. We write the state estimate update and control computation as multivariate polynomials in the encrypted data and propose an extension to the Labeled Homomorphic Encryption scheme that achieves the evaluation of low-degree polynomials on encrypted data, with degree larger than two. We showcase the numerical results of the proposed protocol for a temperature control application that indicates competitive online times.
Homomorphic encryption (HE) applied to a networked controller enables secure operation, but in most cases it allows for addition and multiplication over integers only, because of computation efficiency. Several related results deal with such constraints by means of re-encrypted controller output, based on which the controller can be re-constructed and operate over integers. This paper presents two modified methods based on the output re-encryption, which will further reduce the required communication effort and computational burden, respectively.
The paper presents applications of homomorphic cryptographic schemes in process control. Homomorphic encryption is a particular type of encryption that allows performing mathematical operations over encrypted data. Therefore the user can use third-party services as controllers without revealing any vulnerable information, like process data. Homomorphic properties make it possible to perform data aggregation or evaluate control actions without having any knowledge about the process data. Our paper explores two fully homomorphic cryptographic schemes, namely Brakerski/Fan-Vercauteren (BFV) and Cheon-Kim-Kim-Song (CKKS) cryptosystems. Each scheme is briefly described with its advantages and drawbacks, conditions, and applications. We present a case study involving linear-quadratic (LQ) control strategy implemented in an encrypted setup. This serves for comparison and a step-by-step guide for implementing encrypted process control.