Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2212.01052

Help | Advanced Search

Computer Science > Information Theory

arXiv:2212.01052 (cs)
[Submitted on 2 Dec 2022 ]

Title: Covertly Controlling a Linear System

Title: 隐蔽地控制一个线性系统

Authors:Barak Amihood, Asaf Cohen
Abstract: Consider the problem of covertly controlling a linear system. In this problem, Alice desires to control (stabilize or change the behavior of) a linear system, while keeping an observer, Willie, unable to decide if the system is indeed being controlled or not. We formally define the problem, under a model where Willie can only observe the system's output. Focusing on AR(1) systems, we show that when Willie observes the system's output through a clean channel, an inherently unstable linear system can not be covertly stabilized. However, an inherently stable linear system can be covertly controlled, in the sense of covertly changing its parameter or resetting its memory. Moreover, we give positive and negative results for two important controllers: a minimal-information controller, where Alice is allowed to use only $1$ bit per sample, and a maximal-information controller, where Alice is allowed to view the real-valued output. Unlike covert communication, where the trade-off is between rate and covertness, the results reveal an interesting \emph{three--fold} trade--off in covert control: the amount of information used by the controller, control performance and covertness.
Abstract: 考虑对线性系统进行隐蔽控制的问题。 在这个问题中,Alice希望控制(稳定或改变行为)一个线性系统,同时让观察者Willie无法判断系统是否真的被控制。 我们在一个模型下正式定义了这个问题,其中Willie只能观察系统的输出。 聚焦于AR(1)系统,我们证明了当Willie通过干净信道观察系统输出时,固有不稳定的线性系统无法被隐蔽地稳定。 然而,固有稳定的线性系统可以被隐蔽地控制,在隐蔽地改变其参数或重置其记忆的意义上。 此外,我们给出了两个重要控制器的正负结果:一个最小信息控制器,其中Alice每样本只能使用$1$位,以及一个最大信息控制器,其中Alice可以查看实数值输出。 与隐蔽通信不同,隐蔽通信中的权衡是速率和隐蔽性之间的权衡,而结果揭示了隐蔽控制中一个有趣的\emph{三重的}权衡:控制器使用的的信息量、控制性能和隐蔽性。
Comments: Parts of this work will be presented at the IEEE Information Theory workshop, ITW 2022. arXiv admin note: substantial text overlap with arXiv:2202.02853
Subjects: Information Theory (cs.IT) ; Signal Processing (eess.SP); Systems and Control (eess.SY)
Cite as: arXiv:2212.01052 [cs.IT]
  (or arXiv:2212.01052v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2212.01052
arXiv-issued DOI via DataCite

Submission history

From: Barak Amihood [view email]
[v1] Fri, 2 Dec 2022 09:43:54 UTC (1,180 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
license icon view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2022-12
Change to browse by:
cs
cs.SY
eess
eess.SP
eess.SY
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号