English
Related papers

Related papers: Almost universal codes for fading wiretap channels

200 papers

We propose a new covert communication scheme that operates without pre-sharing side information and channel estimation, utilizing a Gaussian-distributed Grassmann constellation for noncoherent detection. By designing constant-amplitude…

Signal Processing · Electrical Eng. & Systems 2025-02-20 Hiroki Fukada , Hiroki Iimori , Chandan Pradhan , Szabolcs Malomsoky , Naoki Ishikawa

We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the…

Information Theory · Computer Science 2015-03-17 Alexandre J. Pierrot , Matthieu R. Bloch

Anytime reliable communication systems are needed in contexts where the property of vanishing error probability with time is critical. This is the case of unstable real time systems that are to be controlled through the transmission and…

Signal Processing · Electrical Eng. & Systems 2020-02-27 Alberto Tarable , Francisco J. Escribano

We consider a complex Gaussian wiretap channel with finite-resolution analog-to-digital converters (ADCs) at both the legitimate receiver and the eavesdropper. For this channel, we show that a positive secrecy rate is always achievable as…

Information Theory · Computer Science 2020-06-02 Seung-Hyun Nam , Si-Hyeon Lee

Performance of reliable communication over a coherent slow fading channel at high SNR is succinctly captured as a fundamental tradeoff between diversity and multiplexing gains. We study the problem of designing codes that optimally tradeoff…

Information Theory · Computer Science 2007-07-13 Saurabha Tavildar , Pramod Viswanath

A Han-Kobayashi based achievable scheme is presented for ergodic fading two-user Gaussian interference channels (IFCs) with perfect channel state information at all nodes and Gaussian codebooks with no time-sharing. Using max-min…

Information Theory · Computer Science 2010-01-19 Lalitha Sankar , Elza Erkip , H. Vincent Poor

A covert communication system under block fading channels is considered where users experience uncertainty about their channel knowledge. The transmitter seeks to hide the covert communication to a private user by exploiting a legitimate…

Information Theory · Computer Science 2017-03-08 Khurram Shahzad , Xiangyun Zhou , Shihao Yan

We study a symmetric Gaussian wiretap channel with a helper, where a confidential message is sent from a transmitter to a legitimate receiver, in the presence of a helper and an eavesdropper, under a weak notion of secrecy constraint. For…

Information Theory · Computer Science 2019-09-12 Jinyuan Chen , Chunhua Geng

Secure communication over a memoryless wiretap channel in the presence of a passive eavesdropper is considered. Traditional information-theoretic security methods require an advantage for the main channel over the eavesdropper channel to…

Cryptography and Security · Computer Science 2013-11-18 Azadeh Sheikholeslami , Dennis Goeckel , Hossein Pishro-Nik

We design short blocklength codes for the Gaussian wiretap channel under information-theoretic security guarantees. Our approach consists in decoupling the reliability and secrecy constraints in our code design. Specifically, we handle the…

Information Theory · Computer Science 2023-01-24 Vidhi Rana , Remi A. Chou

In this paper, we consider the secrecy capacity of a wiretap channel in the presence of causal state information and secure rate-limited feedback. In this scenario, the causal state information from the channel is available to both the…

Information Theory · Computer Science 2014-08-15 Alejandro Cohen , Asaf Cohen

We consider the problem of polar coding for secure communications over the two-way wiretap channel, where two legitimate users communicate with each other simultaneously while a passive eavesdropper overhears a combination of their…

Information Theory · Computer Science 2017-06-23 Mengfan Zheng , Meixia Tao , Wen Chen , Cong Ling

In this paper, the delay limited secrecy capacity of the flat fading channel is investigated under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of…

Information Theory · Computer Science 2016-11-15 Karim Khalil , Moustafa Youssef , O. Ozan Koyluoglu , Hesham El Gamal

We show how to use decoherence-free subspaces over collective-noise quantum channels to convey classical information in perfect secrecy. We argue that codes defined over decoherence-free subspaces are codes for quantum wiretap channels in…

Quantum Physics · Physics 2012-04-19 Elloá B. Guedes , Francisco M. de Assis

We analyze the exact exponential decay rate of the expected amount of information leaked to the wiretapper in Wyner's wiretap channel setting using wiretap channel codes constructed from both i.i.d. and constant-composition random codes.…

Information Theory · Computer Science 2016-11-30 Mani Bastani Parizi , Emre Telatar , Neri Merhav

We consider transmission over the ergodic fading multi-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the receiver. Over the equivalent {\it non}-fading channel,…

Information Theory · Computer Science 2007-10-14 Amir Bennatan , David Burshtein

Wireless communications is often subject to channel fading. Various statistical models have been proposed to capture the inherent randomness in fading, and conventional model-based receiver designs rely on accurate knowledge of this…

Information Theory · Computer Science 2021-03-30 Mahdi Boloursaz Mashhadi , Nir Shlezinger , Yonina C. Eldar , Deniz Gunduz

We consider the secure transmission in ergodic fast-Rayleigh fading multiple-input single-output single-antennaeavesdropper (MISOSE) wiretap channels. We assume that the statistics of both the legitimate and eavesdropper channels is the…

Information Theory · Computer Science 2015-03-20 Shih-Chun Lin , Pin-Hsun Lin

A polar coding scheme is introduced in this paper for the wire-tap channel. It is shown that the provided scheme achieves the entire rate-equivocation region for the case of symmetric and degraded wire-tap channel, where the weak notion of…

Information Theory · Computer Science 2015-03-17 Eran Hof , Shlomo Shamai

We consider the wiretap channel, where the individual channel uses have memory or are influenced by an adversary. We analyze the explicit and computationally efficient construction of information-theoretically secure coding schemes which…

Cryptography and Security · Computer Science 2024-04-03 Esther Hänggi , Iyán Méndez Veiga , Ligong Wang