Abstract
In this article, we propose an encrypted dynamic controller that executes an unlimited number of recursive homomorphic multiplications on a Ring Learning With Errors (Ring-LWE)-based cryptosystem without bootstrapping. The proposed controller exhibits lower computational complexity compared to existing encrypted controllers implemented on LWE-based schemes due to the polynomial structure of Ring-LWE. However, the structural difference introduces additional difficulties in analyzing the effect of error growth; Ring-LWE-based schemes inject multiple error coefficients when encrypting a single message, which accumulate under recursive homomorphic multiplications. We show that their effect on control performance can be arbitrarily bounded by the closed-loop stability, thus recovering the performance of the unencrypted controller. Furthermore, a novel method to 'pack' a vector into a polynomial is presented, which enhances computational and memory efficiency when applied to the proposed encrypted controller. The effectiveness of the proposed design is demonstrated through numerical simulations.
| Original language | English |
|---|---|
| Pages (from-to) | 2604-2616 |
| Number of pages | 13 |
| Journal | IEEE Transactions on Control of Network Systems |
| Volume | 12 |
| Issue number | 4 |
| DOIs | |
| State | Published - 2025 |
Keywords
- Encrypted control
- homomorphic encryption (HE)
- networked control systems
- privacy
- security
Fingerprint
Dive into the research topics of 'Ring-LWE-Based Encrypted Controller with Unlimited Number of Recursive Multiplications and Effect of Error Growth'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver