Cyber-Physical-Systems and Secrecy Outage Probability: Revisited
Makan Zamanipour

TL;DR
This paper revisits the secrecy outage probability in cyber-physical systems, introducing a geometric framework and a reinforcement learning approach to optimize secrecy performance under various attack scenarios.
Contribution
It develops a novel geometric volume bound for the Riemannian manifold of secrecy rates and proposes a reinforcement learning algorithm for optimal policy determination.
Findings
Derived a new bound for the Riemannian manifold volume related to secrecy rates.
Established a relationship between eigenvalues and secrecy outage probability.
Proposed a reinforcement learning method for optimal secrecy policy under periodic attacks.
Abstract
This paper technically explores the secrecy rate and a maximisation problem over the concave version of the secrecy outage probability (SOP) as . We do this from a generic viewpoint even though we use a traditional Wyner's wiretap channel for our system model something that can be extended to every kind of secrecy modeling and analysis. We consider a Riemannian mani-fold for it and we mathematically define a volume for it as . Through achieving a new bound for the Riemannian mani-fold and its volume, we subsequently relate it to the number of eigen-values existing in the relative probabilistic closure. We prove in-between some novel lemmas with the aid of some useful inequalities such as the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Physical Unclonable Functions (PUFs) and Hardware Security · Adversarial Robustness in Machine Learning
