Secure Estimation and Zero-Error Secrecy Capacity

نویسندگان

  • Moritz Wiese
  • Tobias J. Oechtering
  • Karl Henrik Johansson
  • Panagiotis Papadimitratos
  • Henrik Sandberg
  • Mikael Skoglund
چکیده

We study the problem of estimating the states of an unstable dynamical system subject to nonstochastic disturbances. The estimator obtains all its information through an uncertain channel which is subject to nonstochastic disturbances as well and an eavesdropper obtains a disturbed version of the channel inputs through a second uncertain channel. An encoder observes and block-encodes the states in such a way that, upon sending the generated codeword, the estimator’s error is bounded and such that a security criterion is satisfied ensuring that the eavesdropper obtains as little state information as possible. Two security criteria are considered. A sufficient condition on the uncertain wiretap channel, i.e., the pair formed by the uncertain channel from encoder to estimator and the uncertain channel from encoder to eavesdropper, is derived which ensures that a bounded estimation error and security are achieved. This condition is also shown to be necessary for a subclass of uncertain wiretap channels. To formulate the condition, the zero-error secrecy capacity of uncertain wiretap channels is introduced, i.e., the maximal rate at which data can be transmitted from the encoder to the estimator in such a way that the eavesdropper is unable to reconstruct the transmitted data. The zero-error secrecy capacity of uncertain wiretap channels is studied. M. Wiese, T. J. Oechtering and M. Skoglund are with the Department for Communication Theory, KTH Royal Institute of Technology, Osquldas väg 10, SE-10044 Stockholm, Sweden. K. H. Johansson and H. Sandberg are with the Department for Automatic Control, KTH Royal Institute of Technology, Osquldas väg 10, SE-10044 Stockholm, Sweden. P. Papadimitratos is with the Networked Systems Security Group, KTH Royal Institute of Technology, Osquldas väg 6, SE-10044 Stockholm, Sweden. e-mail: {moritzw, oech, kallej, papadim, hsan, skoglund}@kth.se This paper was presented in part at the 2016 IEEE International Symposium on Information Theory in Barcelona, Spain and at the 55th IEEE Conference on Decision and Control in Las Vegas, USA. ar X iv :1 61 2. 05 55 2v 1 [ cs .S Y ] 1 6 D ec 2 01 6

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Secret Message Transmission over Quantum Channels under Adversarial Quantum Noise: Secrecy Capacity and Super-Activation

We determine the secrecy capacities of arbitrarily varying quantum channels. Both secrecy capacity with average error probability and with maximal error probability are derived. The code we construct fulfills a stringent secrecy requirement, which is called the strong code concept. We determine when the secrecy capacity is a continuous function of the system parameters and completely characteri...

متن کامل

Classical-quantum arbitrarily varying wiretap channel: Ahlswede dichotomy, positivity, resources, super-activation

We establish the Ahlswede dichotomy for arbitrarily varying classicalquantum wiretap channels, i.e., either the deterministic secrecy capacity of the channel is zero, or it equals its randomness-assisted secrecy capacity. We analyze the secrecy capacity of these channels when the sender and the receiver use various resources. It turns out that randomness, common randomness, and correlation as r...

متن کامل

Multihop Decode-and-Forward Relay Networks: Secrecy Analysis and Relay Position Optimization

Relay communication has advantages over direct transmission in terms of secrecy capacity. In this paper, the performance of secrecy, offered by multihop decode-and-forward relaying, is investigated and compared to its counterpart in direct transmission. Three key performance measures are derived over Rayleigh fading channels: probability of non-zero secrecy capacity, secure outage probability a...

متن کامل

On Capacity Region of Wiretap Networks

In this paper we study the problem of secure communication over networks in which an unknown subset of nodes or links can be wiretapped. We first consider a general multi-terminal discrete memoryless network (DMN) described by its channel transition function from network inputs to network outputs, observed by network nodes and the eavesdropper. We prove that in such general networks with multip...

متن کامل

The MIMOME Channel

The MIMOME channel is a Gaussian wiretap channel in which the sender, receiver, and eavesdropper all have multiple antennas. We characterize the secrecy capacity as the saddle-value of a minimax problem. Among other implications, our result establishes that a Gaussian distribution maximizes the secrecy capacity characterization of Csiszár and Körner when applied to the MIMOME channel. We also d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1612.05552  شماره 

صفحات  -

تاریخ انتشار 2016