English
Related papers

Related papers: Modular Neural Wiretap Codes for Fading Channels

200 papers

We consider block codes for degraded wiretap channels in which the legitimate receiver decodes the message with an asymptotic error probability no larger than $\varepsilon$ but the leakage to the eavesdropper vanishes. For discrete…

Information Theory · Computer Science 2014-09-29 Vincent Y. F. Tan , Matthieu R. Bloch

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and…

Information Theory · Computer Science 2025-09-29 Amir Reza Ramtin , Dennis Goeckel , Don Towsley

From an arbitrary given channel code over a discrete or Gaussian memoryless channel, we construct a wiretap code with the strong security. Our construction can achieve the wiretap capacity under mild assumptions. The key tool is the new…

Information Theory · Computer Science 2010-10-06 Masahito Hayashi , Ryutaroh Matsumoto

Wyner's work on wiretap channels and the recent works on information theoretic security are based on random codes. Achieving information theoretical security with practical coding schemes is of definite interest. In this note, the attempt…

Information Theory · Computer Science 2010-03-09 O. Ozan Koyluoglu , Hesham El Gamal

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

We improve the secrecy guarantees for transmission over general binary memoryless symmetric wiretap channels that relies on regular LDPC codes. Previous works showed that LDPC codes achieve secrecy capacity of some classes of wiretap…

Information Theory · Computer Science 2025-02-11 Madhura Pathegama , Alexander Barg

The problem of identification over a discrete memoryless wiretap channel is examined under the criterion of semantic effective secrecy. This secrecy criterion guarantees both the requirement of semantic secrecy and of stealthy…

Information Theory · Computer Science 2025-02-27 Abdalla Ibrahim , Johannes Rosenberger , Boulat A. Bash , Christian Deppe , Roberto Ferrara , Uzi Pereg

This article examines the queueing performance of communication systems that transmit encoded data over unreliable channels. A fading formulation suitable for wireless environments is considered where errors are caused by a discrete channel…

Information Theory · Computer Science 2013-09-16 Fatemeh Hamidi-Sepehr , Henry D. Pfister , Jean-Francois Chamberland

Constrained sequence codes have been widely used in modern communication and data storage systems. Sequences encoded with constrained sequence codes satisfy constraints imposed by the physical channel, hence enabling efficient and reliable…

Information Theory · Computer Science 2018-09-07 Congzhe Cao , Duanshun Li , Ivan Fair

Information leakage in Wyner's wiretap channel model is usually defined as the mutual information between the secret message and the eavesdropper's received signal. We define a new quantity called "conditional information leakage given the…

Information Theory · Computer Science 2019-01-28 Yutaka Jitsumatsu , Ukyo Michiwaki , Yasutada Oohama

In a classical wiretap channel setting, Alice communicates with Bob through a main communication channel, while her transmission also reaches an eavesdropper Eve through a wiretap channel. In this paper, we consider a general class of polar…

Information Theory · Computer Science 2024-07-02 Hessam Mahdavifar , Fariba Abbasi

Achieving information-theoretic security using explicit coding scheme in which unlimited computational power for eavesdropper is assumed, is one of the main topics is security consideration. It is shown that polar codes are capacity…

Most of the well-known fading distributions, if not all of them, could be encompassed by Fox's $H$-function fading. Consequently, we investigate the exact and asymptotic behavior of physical layer security (PLS) over Fox's $H$-function…

Information Theory · Computer Science 2019-05-10 Long Kong , Georges Kaddoum , Hatim Chergui

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

In this paper, we investigate the design of artificial-noise-aided secure multi-antenna transmission in slow fading channels. The primary design concerns include the transmit power allocation and the rate parameters of the wiretap code. We…

Information Theory · Computer Science 2016-11-17 Xi Zhang , Xiangyun Zhou , Matthew R. McKay

In this paper, we use a linear programming (LP) optimization approach to evaluate the equivocation for a wiretap channel where the main channel is noiseless, and the wiretap channel is a binary symmetric channel (BSC). Using this technique,…

Information Theory · Computer Science 2024-01-17 Ali Nikkhah , Morteza Shoushtari , Bahareh Akhbari , Willie K. Harrison

We consider the multi-antenna wiretap channel in which the transmitter wishes to send a confidential message to its receiver while keeping it secret to the eavesdropper. It has been known that the secrecy capacity of such a channel does not…

Information Theory · Computer Science 2016-11-17 Mari Kobayashi , Pablo Piantanida , Sheng Yang , Shlomo Shamai

This paper considers delay-limited communication over quasi-static fading channels under a long-term power constraint. A sequence of length-$n$ delay-limited codes for a quasi-static fading channel is said to be capacity-achieving if the…

Information Theory · Computer Science 2016-11-15 Silas L. Fong , Vincent Y. F. Tan

Physical-layer security (PLS) is a promising technique to complement more traditional means of communication security in beyond-5G wireless networks. However, studies of PLS are often based on ideal assumptions such as infinite coding…

Information Theory · Computer Science 2024-05-14 Milad Tatar Mamaghani , Xiangyun Zhou , Nan Yang , A. Lee Swindlehurst , H. Vincent Poor

Finite-length codes are learned for the Gaussian wiretap channel in an end-to-end manner assuming that the communication parties are equipped with deep neural networks (DNNs), and communicate through binary phase-shift keying (BPSK)…

Machine Learning · Computer Science 2020-03-25 Alireza Nooraiepour , Sina Rezaei Aghdam