English
Related papers

Related papers: Strong Converse for a Degraded Wiretap Channel via…

200 papers

We prove that several known upper bounds on the classical capacity of thermal and additive noise bosonic channels are actually strong converse rates. Our results strengthen the interpretation of these upper bounds, in the sense that we now…

Quantum Physics · Physics 2014-07-29 Bhaskar Roy Bardhan , Mark M. Wilde

The secrecy capacity of a network, for a given collection of permissible wiretap sets, is the maximum rate of communication such that observing links in any permissible wiretap set reveals no information about the message. This paper…

Information Theory · Computer Science 2016-11-17 Tao Cui , Tracey Ho , Joerg Kliewer

This paper strengthens the interpretation and understanding of the classical capacity of the pure-loss bosonic channel, first established in [Giovannetti et al., Physical Review Letters 92, 027902 (2004), arXiv:quant-ph/0308012]. In…

Quantum Physics · Physics 2014-07-22 Mark M. Wilde , Andreas Winter

Information-theoretic work for wiretap channels is mostly based on random coding schemes. Designing practical coding schemes to achieve information-theoretic security is an important problem. By applying the two recently developed…

Information Theory · Computer Science 2014-10-15 Yi-Peng Wei , Sennur Ulukus

Achieving security against adversaries with unlimited computational power is of great interest in a communication scenario. Since polar codes are capacity achieving codes with low encoding-decoding complexity and they can approach perfect…

Information Theory · Computer Science 2018-01-23 Amirsina Torfi , Sobhan Soleymani , Siamak Aram , Vahid Tabataba Vakili

We study a hypothesis testing problem with a privacy constraint over a noisy channel and derive the performance of optimal tests under the Neyman-Pearson criterion. The fundamental limit of interest is the privacy-utility tradeoff (PUT)…

Information Theory · Computer Science 2021-05-28 Lin Zhou , Daming Cao

An arbitrarily varying wiretap channel (AVWTC) with a type constraint on the allowed state sequences is considered, and a single-letter characterization of its correlated-random (CR) assisted semantic-security (SS) capacity is derived. The…

Information Theory · Computer Science 2016-10-19 Ziv Goldfeld , Paul Cuff , Haim H. Permuter

Uncertain wiretap channels are introduced. Their zero-error secrecy capacity is defined. If the sensor-estimator channel is perfect, it is also calculated. Further properties are discussed. The problem of estimating a dynamical system with…

The coding problem for wiretap channels with causal channel state information (CSI) available at the encoder (Alice) and/or the decoder (Bob) is studied. We are concerned here particularily with the problem of achievable secret-message…

Information Theory · Computer Science 2021-08-10 Te Sun Han , Masahide Sasaki

The wiretap channel is a well-studied problem in the physical layer security literature. Although it is proven that the decoding error probability and information leakage can be made arbitrarily small in the asymptotic regime, further…

Information Theory · Computer Science 2025-03-19 Daniel Seifert , Onur Günlü , Rafael F. Schaefer

In a point-to-point communication system which consists of a sender, a receiver and a set of noiseless channels, the sender wishes to transmit a private message to the receiver through the channels which may be eavesdropped by a wiretapper.…

Information Theory · Computer Science 2015-03-20 Fan Cheng , Raymond W. Yeung , Kenneth W. Shum

We show that polar codes asymptotically achieve the whole capacity-equivocation region for the wiretap channel when the wiretapper's channel is degraded with respect to the main channel, and the weak secrecy notion is used. Our coding…

Information Theory · Computer Science 2010-09-27 Mattias Andersson , Vishwambhar Rathi , Ragnar Thobaben , Joerg Kliewer , Mikael Skoglund

We show that the capacity region of the broadcast channel with confidential messages does not change when the strong security criterion is adopted instead of the weak security criterion traditionally used. We also show a construction method…

Information Theory · Computer Science 2011-05-25 Ryutaroh Matsumoto , Masahito Hayashi

Consider a communication network represented by a directed graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$, where $\mathcal{V}$ is the set of nodes and $\mathcal{E}$ is the set of point-to-point channels in the network. On the network a…

Information Theory · Computer Science 2014-10-14 Fan Cheng , Raymond W. Yeung

The reliability function of memoryless channels with noiseless feedback and variable-length coding has been found to be a linear function of the average rate in the classic work of Burnashev. In this work we consider unifilar channels with…

Information Theory · Computer Science 2017-07-13 Achilleas Anastasopoulos , Jui Wu

The reliability function of a channel is the maximum achievable exponential rate of decay of the error probability as a function of the transmission rate. In this work, we derive bounds on the reliability function of discrete memoryless…

Information Theory · Computer Science 2023-06-13 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

In this paper we consider the robust secure beamformer design for MISO wiretap channels. Assume that the eavesdroppers' channels are only partially available at the transmitter, we seek to maximize the secrecy rate under the transmit power…

Information Theory · Computer Science 2013-10-29 Shuai Ma , Mingyi Hong , Enbin Song , Xiangfeng Wang , Dechun Sun

The model of wiretap channel (WTC) is important as it constitutes the essence of physical layer security (PLS). Wiretap channel with noiseless feedback (WTC-NF) is especially interesting as it shows what can be done when a private feedback…

Information Theory · Computer Science 2018-04-26 Bin Dai

We consider reversely-degraded secure-communication channels, for which the secrecy capacity is zero if there is no channel feedback. Specifically, we focus on a seeded modular code design for the block-fading Gaussian wiretap channel with…

Information Theory · Computer Science 2026-05-13 Yingyao Zhou , Natasha Devroye , Onur Günlü

This paper presents novel numerical approaches to finding the secrecy capacity of the multiple-input multiple-output (MIMO) wiretap channel subject to multiple linear transmit covariance constraints, including sum power constraint, per…

Information Theory · Computer Science 2021-07-09 Anshu Mukherjee , Björn Ottersten , Le-Nam Tran
‹ Prev 1 4 5 6 7 8 10 Next ›