Search arXivSearch

arXiv · 2112.02931

Encrypted dynamic control with unlimited operating time via FIR filters

Abstract

Encrypted control enables confidential controller evaluations in cloud-based or networked control systems. From a technical point of view, an encrypted controller is a modified control algorithm that is capable of computing encrypted control actions based on encrypted system outputs. Unsurprisingly, encrypted implementations of controllers using, e.g., homomorphic cryptosystems entail new design challenges. For instance, in order to avoid overflow or high computational loads, only a finite number of operations should be carried out on encrypted data. Clearly, this guideline is hard to satisfy for dynamic controllers due to their recursive nature. To enable an unlimited operating time, existing implementations thus rely on external refreshments of the controller state, internal refreshments using bootstrapping, or recurring controller resets. We show in this paper that simple FIR filter-based controllers allow overcoming many drawbacks of the existing approaches. In fact, since FIR filters consider only a finite amount of the most recent input data, the recursion issue is immediately solved and controller refreshments or resets are no longer required. Moreover, well-designed FIR filters are often less complex than and equally effective as IIR controllers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

N. Schlüter, M. Neuhaus, M. Schulze Darup. 2021-12-06. Encrypted dynamic control with unlimited operating time via FIR filters. https://arxiv.org/abs/2112.02931

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Observability and parameter estimation of a generic model for aggregated distributed energy resources

We propose a novel framework for estimating the parameters of an aggregated distributed energy resources (DER A) model. First, we introduce a rigorous method to determine whether all model parameters are estimable. When they are not, our approach identifies the subset of parameters that can be estimated. The proposed framework offers new insights into the number and specific parameters that can be reliably estimated based on commonly available measurements. It also highlights the limitations of calibrating such models. Second, we introduce a Kalman filtering method to calibrate the DER A model. Since we account for nonlinear effects such as saturation and deadbands, we develop a specific mechanism to handle smoothing functions within the Kalman filter. Specifically, we consider the extended and the unscented Kalman filter. We demonstrate the effectiveness of the proposed framework on a modified IEEE 34-node distribution feeder with inverter- based resources. Our findings align with the North American Electric Reliability Corporation's parameterization guideline and underscore the importance of model calibration in accurately capturing the collective dynamics of distributed energy resources installed on distribution systems.

eess.SY

Salted Fisher Information for Hybrid Systems

Discrete events change how parameter-influence propagates in hybrid systems. Prevailing Fisher information for- mulations assume that sensitivities evolve smoothly according to continuous-time variational equations and therefore neglect the sensitivity updates induced by discrete events. This paper derives a Fisher information matrix formulation compatible with hybrid systems. To do so, we use the saltation matrix, which encodes the first-order transformation of sensitivities induced by discrete events. We call the resulting formulation the salted Fisher information matrix (SFIM). The proposed framework unifies continuous information accumulation during flows with discrete updates at event times. We also show that hybrid persistence of excitation is sufficient for the SFIM to be positive definite

eess.SY

Min-Max Grassmannian Optimization for Online Subspace Tracking

We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In video separation, it achieves higher precision and a better precision--recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.

eess.SY