mlsanityData to 13 Oct 2026

A Dynamic Watermarking Algorithm for Finite Markov Decision Problems

arXiv 2111.04952 ↗First posted 9 Nov 2021eess.SY cs.SYcited by 1

Not on the map. Why?

Abstract (arXiv)

Dynamic watermarking, as an active intrusion detection technique, 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 and present upper bounds on the mean time between false alarms, and 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.

Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). First posted on arXiv 9 Nov 2021.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.