Metraipolis › archive › dc_62efa47c1919

Iterative Behavioral Identification for Covert Misappropriation Attacks — arXiv:2610.32662

Source: arXiv (en)
Original: https://arxiv.org/abs/2610.32662
License (as archived): CC0-1.0
Archived: 2026-10-26T20:07:40.600Z
SHA-256 of the archived text: c9de4c531c088e577a369b9b1f7668dffaf7b04e9caa1de4e8e89ec914dcf833
Stable URL of this page: https://metraipolis.com/documento/dc_62efa47c1919

How to cite

Iterative Behavioral Identification for Covert Misappropriation Attacks — arXiv:2610.32662 — arXiv (en), https://arxiv.org/abs/2610.32662 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_62efa47c1919 (Metraipolis archive dc_62efa47c1919, sha256 c9de4c531c088e577a369b9b1f7668dffaf7b04e9caa1de4e8e89ec914dcf833)

BibTeX

@misc{dc62efa47c1919,
  title = {Iterative Behavioral Identification for Covert Misappropriation Attacks — arXiv:2610.32662},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.32662},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_62efa47c1919; sha256 c9de4c531c088e577a369b9b1f7668dffaf7b04e9caa1de4e8e89ec914dcf833},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.32662. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We present a data-driven, three-phase framework for covert misappropriation attacks on closed-loop networked control systems. A man-in-the-middle (MITM) adversary, with access only to intercepted input-output data, incrementally identifies the plant's behavioral subspace while maintaining stealth under an infinity-norm intrusion-detection system (IDS). Phase 1 collects an initial rank-deficient Hankel matrix using a low-amplitude probing signal that satisfies an analytical stealth bound. Phase 2 adapts online rank-increasing experiment design to the closed-loop setting, using causal predictor-based masking to limit IDS residuals while the Hankel rank grows from 1 to the full behavioral rank n + mL in exactly n + mL - 1 steps. We show that the identified subspaces are strictly nested and that the projection error of any desired trajectory decreases monotonically, strictly so almost surely at each rank increase. Phase 3 employs the final Hankel matrix in a DeePC-style optimization to synthesize a covert attack that tracks an arbitrary reference while respecting the IDS constraint. Simulations on a DC motor with PI control demonstrate full-rank identification and stealthy tracking. Stealth is guaranteed analytically in Phases 1 and 3 and is numerically supported in Phase 2. The method is model-free and assumes noise-free LTI dynamics.

Tema degli esploratori: fiducia digitale e crittografia (elenco arXiv cs.CR, nuovi lavori del giorno).
Categorie arXiv: Systems and Control (eess.SY) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2610.32662 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-26T19:48:33.279Z dalla pagina https://arxiv.org/list/cs.CR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).