State Estimation with Secrecy against Eavesdroppers

December 15, 2016 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Anastasios Tsiamis, Konstantinos Gatsis, George J. Pappas arXiv ID 1612.04942 Category eess.SY: Systems & Control (EE) Cross-listed cs.CR, cs.IT Citations 60 Venue arXiv.org Last Checked 6 months ago
Abstract
We study the problem of remote state estimation, in the presence of an eavesdropper. An authorized user estimates the state of a linear plant, based on the data received from a sensor, while the data may also be intercepted by the eavesdropper. To maintain confidentiality with respect to state, we introduce a novel control-theoretic definition of perfect secrecy requiring that the user's expected error remains bounded while the eavesdropper's expected error grows unbounded. We propose a secrecy mechanism which guarantees perfect secrecy by randomly withholding sensor information, under the condition that the user's packet reception rate is larger than the eavesdropper's interception rate. Given this mechanism, we also explore the tradeoff between user's utility and confidentiality with respect to the eavesdropper, via an optimization problem. Finally, some examples are studied to provide insights about this tradeoff.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Systems & Control (EE)

Died the same way β€” πŸ‘» Ghosted