Jiacheng Tang

Jiacheng Tang

Auto-generated profile, based on publicly available information

Jiacheng Tang

Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

29 December 2022 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
JTJiacheng Tang
Jiacheng Tang
SSShiping Shao
Shiping Shao
JSJiguo Song
Jiguo Song
AGAbhishek Gupta
Abhishek Gupta
A bus-off attack is a denial-of-service (DoS) attack which exploits error handling in the controller area network (CAN) to induce an honest node to disconnect itself from the CAN bus. This paper develops a stochastic transmission policy as a countermeasure for the controller-transmitter pair against the bus-off attack. We model this as a non-zero-sum linear-quadratic-Gaussian game between the controller-transmitter pair and the attacker. We derive Nash equilibria of the game for two different information structures of the attacker. We show that the attacker has a dominant attack strategy under both information structures. Under the dominant attack strategy, we show that the optimal control policy is linear in the system state. We further identify a necessary and a sufficient conditions on the transmission policy to have bounded average cost. The theoretical results are complemented by a detailed case study of a bus-off attack on a vehicular adaptive cruise control model.

11 June 2021 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
JTJiacheng Tang
Jiacheng Tang
AGAbhishek Gupta
Abhishek Gupta
We consider here a scenario where a team of agents want to switch from a fully connected communication network to a network with limited bandwidth because of a cyber attack. The goal is to identify which communication link should still be active in the new network for near-optimal overall performance. This is formulated as a cardinality constrained quadratic minimization problem, which is NP-hard in general. To obtain an approximately optimal solution efficiently, we used random projection (RP) for dimensionality reduction. We show that the value of the sketched team is bounded above by a constant factor times the optimal value of the team with high probability.

6 January 2025 in IEEE Open Journal of Control Systems
Verified
Journal Article
Open access
JTJiacheng Tang
Jiacheng Tang
JSJiguo Song
Jiguo Song
AGAbhishek Gupta
Abhishek Gupta
Dynamic watermarking is an active intrusion detection technique that can potentially detect replay attacks, spoofing attacks, and deception attacks in the feedback channel for control systems. In this paper, we develop a novel dynamic watermarking algorithm for finite-state finite-action Markov decision processes. We derive a lower bound on the mean time between false alarms and an upper bound on the mean delay between the time an attack occurs and when it is detected. We further compute the sensitivity of the performance of the control system as a function of the watermark. We demonstrate the effectiveness of the proposed dynamic watermarking algorithm by detecting a spoofing attack in a sensor network system.