Pith. sign in

REVIEW

A Dynamic Watermarking Algorithm for Finite Markov Decision Problems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.04952 v1 pith:KMLX3LKA submitted 2021-11-09 eess.SY cs.SY

classification eess.SYcs.SY
keywords dynamicwatermarkingalgorithmattacksattackcontroldecisionmarkov
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Pith tools