LLLe Liu

Le Liu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Le Liu has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Design of Stochastic Quantizers for Privacy-Preserving Control

    by Le Liu, Yu Kawano, Ming Cao

    In this article, we examine the role of stochastic quantizers for privacy preservation in control systems. We first employ a static stochastic quantizer and investigate its privacy-preserving properties regarding the system’s initial state. Specifically, we demonstrate that a sufficiently large quantization step guarantees $(0, \delta)$ differential privacy. In addition, the degradation of control performance caused by quantization is evaluated as the tracking error of output regulation. These two analyses characterize the tradeoff between privacy and control performance, determined by the quantization step. This insight enables us to use quantization intentionally as a means to achieve the seemingly conflicting two goals of maintaining control performance and preserving privacy at the same time; toward this end, we further investigate a dynamic stochastic quantizer. Under a stability assumption, the dynamic stochastic quantizer can enhance privacy, more than the static one, while achieving the same control performance. We further handle the unstable case by additionally applying input Gaussian noise.


  • Distributionally Robust Model Order Reduction for Linear Systems

    by Le Liu, Yu Kawano, Yangming Dou, Ming Cao

    In this paper, we investigate distributionally robust model order reduction for linear, discrete-time, time-invariant systems. The external input is assumed to follow an uncertain distribution within a Wasserstein ambiguity set. We begin by considering the case where the distribution is certain and formulate an optimization problem to obtain the reduced model. When the distribution is uncertain, the interaction between the reduced-order model and the distribution is modeled by a Stackelberg game. To ensure solvability, we first introduce the Gelbrich distance and demonstrate that the Stackelberg game within a Wasserstein ambiguity set is equivalent to that within a Gelbrich ambiguity set. Then, we propose a nested optimization problem to solve the Stackelberg game. Furthermore, the nested optimization problem is relaxed into a nested convex optimization problem, ensuring computational feasibility. Finally, a simulation is presented to illustrate the effectiveness of the proposed method.


  • Open Access

    Initial State Privacy of Nonlinear Systems on Riemannian Manifolds

    by Le Liu, Yu Kawano, Antai Xie, Ming Cao

    In this paper, we investigate initial state privacy protection for discrete‐time nonlinear closed systems. By capturing Riemannian geometric structures inherent in such privacy challenges, we refine the concept of differential privacy through the introduction of an initial state adjacency set based on Riemannian distances. The proposed framework extends beyond initial state protection to also cover system parameter privacy, which is demonstrated as a special application.


  • Denial-of-Service Attacks on Cyber-Physical Systems Against Linear Quadratic Control: A Stackelberg-Game Analysis

    by Wei Xing, Xudong Zhao, Yuzhe Li, Le Liu

    This paper concentrates on the linear quadratic control of cyber-physical systems subject to denial-of-service attacks. A Stackelberg game framework is proposed to analyze the strategic interaction between a sensor and an attacker considering a standard block fading wireless communication channel. The reward function composing of the linear quadratic control consumption and the power consumption is provided on account of energy constraints of the sensor and the attacker. To proactively overcome the difficulty in characterizing or computing the Stackelberg equilibrium (SE), the formulated game is actively transformed into a Markov decision process (MDP) under a restricted information structure, enabling the extraction of essential SE properties. In addition, the reward function is approximated to derive an analytical expression of a suboptimal SE of the game based on an approximate dynamic programming. As a special case, the investigation also delves into the capacity achieving coding scheme. Finally, numerical examples are provided to illustrate the effectiveness of the obtained results.


  • Remote State Estimation Under DoS Attacks in CPSs With Arbitrary Tree Topology: A Bayesian Stackelberg Game Approach

    by Yuhan Wang, Wei Xing, Junfeng Zhang, Le Liu, Xudong Zhao

    remote state estimation for an arbitrary tree topology in cyber-physical systems (CPSs) subject to Denial-of-Service (DoS) attacks. A sensor transmits its local estimation to the root node of the tree, and the root node transmits the optimal estimation to its child nodes until the leaf nodes are reached. In the meanwhile, a malicious attacker can jam all communication channels strategically connected to the attacked node. With the energy constraints in mind, both the defender and attacker adopt strategies that involve allocating energy to determine which nodes to protect or attack at each time step. A Bayesian Stackelberg game (BSG) framework with incomplete information is implemented, where the defender has no access to the available energy of the attacker exactly except for its probability distribution. In addition, a Markov decision process (MDP) and a Stackelberg Q-learning algorithm are presented to obtain the Stackelberg equilibrium (SE) policy over a finite time horizon. Finally, a numerical example is provided to demonstrate our main results.


  • Stochastic Event-Based Physical Watermarks Against Replay Attacks in Cyber-Physical Systems

    by Xudong Zhao, Le Liu, Wei Xing, Ning Xu

    In this paper, an event-based physical watermark is proposed and analyzed. It is well known that adding physical watermarks into Cyber-Physical Systems (CPSs) is an effective way to combat malicious attacks. However, the classical ways to adding physical watermarks are based on time, which leads to great decreases in Linear Quadratic Gaussian (LQG) performances while increasing detection rates. To deal with the performance loss after adding physical watermarks, an event-based physical watermark is designed to detect replay attacks. A stochastic event scheduler based on the innovation sequence is constructed to indicate adding physical watermarks or not. It is shown that the probability of adding physical watermarks will rise up if the system is under attacks. Based on the frequency of adding watermarks, a Count Detector is proposed, which provides lower memory and computation cost. LQG performance and detection rates of a $\chi ^{2}$ detector are further characterized. Herein, it is formally proved that the event-based independent identical distributed (i.i.d.) watermark is more efficient than the time-based i.i.d. watermark. Furthermore, we investigate the optimal parameters to enlarge detection performance in certain conditions. Finally, some simulations are given to show the superiority of our proposed event-based physical watermark.


  • Event-Triggered Reverse Attacks on Remote State Estimation

    by Xudong Zhao, Le Liu, Michael V. Basin, Zhongyang Fei

    Security issues in cyber-physical systems have attracted increasing attention in recent years. In this paper, a security problem in a remote estimation application is considered, where an attacker tries to degrade estimation performance via malicious attacks. In our scenario, a smart sensor transmits its innovation to a remote estimator with a residue-based false data detector. Instead of assuming that the attacker launches a consecutive man-in-the-middle attack, we consider the case with intermittent attacks. Reverse attack is a simple attack strategy, which enables an attacker to change signs of the innovation sequences. Therefore, owing to the above reasons, an event-triggered reverse attack strategy is proposed to degrade system performance. First, the stealthiness of the event-triggered linear deception attack strategy is studied. Then, the evolution of the estimation error covariance is computed and the reverse attack is proven to be the optimal linear deception attack. We demonstrate that our event-triggered reverse attack is more destructive than a random reverse attack. Furthermore, a convex optimization problem is established to design event-triggered parameters. Comparisons of attack strategies are provided in a numerical example to validate the superiority of the reverse attack.


  • Open Access

    Periodic Event-Triggered Estimation for Networked Control Systems

    by Shitong Cui, Le Liu, Wei Xing, Xudong Zhao

    This paper considers the problem of remote state estimation in a linear discrete invariant system, where a smart sensor is utilized to measure the system state and generate a local estimate. The communication depends on an event scheduler in the smart sensor. When the channel between the remote estimator and the smart sensor is activated, the remote estimator simply adopts the estimate transmitted by the smart sensor. Otherwise, it calculates an estimate based on the available information. The closed-form of the minimum mean-square error (MMSE) estimator is introduced, and we use Gaussian preserving event-based sensor scheduling to obtain an ideal compromise between the communication cost and estimation quality. Furthermore, we calculate a variation range of communication probability, which helps to design the policy of event-triggered estimation. Finally, the simulation results are given to illustrate the effectiveness of the proposed event-triggered estimator.