On the Secrecy Exponent of the Wire-tap Channel
arXiv:1501.06287 · doi:10.1109/ITWF.2015.7360781
Abstract
We derive an exponentially decaying upper-bound on the unnormalized amount of information leaked to the wire-tapper in Wyner's wire-tap channel setting. We characterize the exponent of the bound as a function of the randomness used by the encoder. This exponent matches that of the recent work of Hayashi (2011) which is, to the best of our knowledge, the best exponent that exists in the literature. Our proof---like those of Han et al. (2014) and Hayashi (2015)---is exclusively based on an i.i.d. random coding construction while that of Hayashi (2011), in addition, requires the use of random universal hash functions.
arXiv comment8 pages, 2 figures; to be presented at 2015 IEEE Information Theory Workshop (ITW'2015)
References in corpus (8)
- Exponential decreasing rate of leaked information in universal random privacy amplification
- Secure Multiplex Coding with Dependent and Non-Uniform Multiple Messages
- Exact random coding error exponents of optimal bin index decoding
- The Sender-Excited Secret Key Agreement Model: Capacity, Reliability and Secrecy Exponents
- Effective Secrecy: Reliability, Confusion and Stealth
- Informational Divergence Approximations to Product Distributions
- On the Secrecy Exponent of the Wire-tap Channel
- Universally Attainable Error and Information Exponents, and Equivocation Rate for the Broadcast Channels with Confidential Messages