English
Related papers

Related papers: Efficient Codes for Adversarial Wiretap Channels

200 papers

This paper considers the problem of end-end security enhancement by resorting to deliberate noise injected in ciphertexts. The main goal is to generate a degraded wiretap channel in application layer over which Wyner-type secrecy encoding…

Cryptography and Security · Computer Science 2012-04-03 Yahya S. Khiabani , Shuangqing Wei , Jian Yuan , Jian Wang

Sparse superposition codes are a recent class of codes introduced by Barron and Joseph for efficient communication over the AWGN channel. With an appropriate power allocation, these codes have been shown to be asymptotically…

Information Theory · Computer Science 2018-03-19 Adam Greig , Ramji Venkataramanan

We consider the problem of communication over a network containing a hidden and malicious adversary that can control a subset of network resources, and aims to disrupt communications. We focus on omniscient node-based adversaries, i.e., the…

Information Theory · Computer Science 2016-05-09 Peida Tian , Sidharth Jaggi , Mayank Bakshi , Oliver Kosut

We provide the first capacity approaching coding schemes that robustly simulate any interactive protocol over an adversarial channel that corrupts any $\epsilon$ fraction of the transmitted symbols. Our coding schemes achieve a…

Data Structures and Algorithms · Computer Science 2014-11-04 Bernhard Haeupler

In the literature, it has been shown that the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel with noise-free feedback equals the capacity of the same model without secrecy constraint, and the classical…

Information Theory · Computer Science 2026-01-15 Sheng Su , Yuhan Yang , Chao Qi , Xuan He , Bin Dai , Xiaohu Tang

Secrecy capacity of a multiple-antenna wiretap channel is studied in the low signal-to-noise ratio (SNR) regime. Expressions for the first and second derivatives of the secrecy capacity with respect to SNR at SNR = 0 are derived.…

Information Theory · Computer Science 2009-10-22 Mustafa Cenk Gursoy

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

Covert communication conceals the transmission of the message from an attentive adversary. Recent work on the limits of covert communication in additive white Gaussian noise (AWGN) channels has demonstrated that a covert transmitter (Alice)…

Information Theory · Computer Science 2018-09-25 Ramin Soltani , Dennis Goeckel , Don Towsley , Boulat Bash , Saikat Guha

Covert communication, also known as low probability of detection (LPD) communication, prevents the adversary from knowing that a communication is taking place. Recent work has demonstrated that, in a three-party scenario with a transmitter…

Information Theory · Computer Science 2017-11-29 Ramin Soltani , Boulat Bash , Dennis Goeckel , Saikat Guha , Don Towsley

Recent advances in natural language generation have introduced powerful language models with high-quality output text. However, this raises concerns about the potential misuse of such models for malicious purposes. In this paper, we study…

Cryptography and Security · Computer Science 2021-03-30 Sahar Abdelnabi , Mario Fritz

This paper studies secrecy-capacity of an $n$-dimensional Gaussian wiretap channel under a peak-power constraint. This work determines the largest peak-power constraint $\bar{\mathsf{R}}_n$ such that an input distribution uniformly…

Information Theory · Computer Science 2023-05-17 Antonino Favano , Luca Barletta , Alex Dytso

The wiretap channel has been devised and studied first by Wyner, and subsequently extended to the case with non-degraded general wiretap channels by Csiszar and Korner. Focusing mainly on the Poisson wiretap channel with cost constraint, we…

Information Theory · Computer Science 2014-08-20 Te Sun Han , Hiroyuki Endo , Masahide Sasaki

In this paper, we consider the transmit design for multi-input multi-output (MIMO) wiretap channel including a malicious jammer. We first transform the system model into the traditional three-node wiretap channel by whitening the…

Information Theory · Computer Science 2016-11-30 Duo Zhang , Weidong Mei , Lingxiang Li , Zhi Chen

In this paper, we consider encoding strategies for the Z-channel with noiseless feedback. We analyze the combinatorial setting where the maximum number of errors inflicted by an adversary is proportional to the number of transmissions,…

Information Theory · Computer Science 2021-02-11 Christian Deppe , Vladimir Lebedev , Georg Maringer , Nikita Polyanskii

This letter investigates the secret communication problem for a fluid antenna system (FAS)-assisted wiretap channel, where the legitimate transmitter transmits an information-bearing signal to the legitimate receiver, and at the same time,…

Information Theory · Computer Science 2024-07-03 Hao Xu , Kai-Kit Wong , Wee Kiat New , Guyue Li , Farshad Rostami Ghadi , Yongxu Zhu , Shi Jin , Chan-Byoung Chae , Yangyang Zhang

We investigate the problem of reliable communication in the presence of active adversaries that can tamper with the transmitted data. We consider a legitimate transmitter-receiver pair connected over multiple communication paths (routes).…

Information Theory · Computer Science 2014-04-28 Mahtab Mirmohseni , Panagiotis Papadimitratos

With the growth of wireless networks, security has become a fundamental issue in wireless communications due to the broadcast nature of these networks. In this work, we consider MIMO wiretap channels in a fast fading environment, for which…

Information Theory · Computer Science 2014-11-04 Maksym A. Girnyk , Frédéric Gabry , Mikko Vehkaperä , Lars K. Rasmussen , Mikael Skoglund

We consider the problem of finding secrecy rate of a multiple-input multiple-output (MIMO) wire-tap channel. A transmitter, a legitimate receiver, and an eavesdropper are all equipped with multiple antennas. The channel states from the…

Information Theory · Computer Science 2014-11-04 Arash Khabbazibasmenj , Maksym A. Girnyk , Sergiy A. Vorobyov , Mikko Vehkaperä , Lars K. Rasmussen

We consider a communication network where there exist wiretappers who can access a subset of channels, called a wiretap set, which is chosen from a given collection of wiretap sets. The collection of wiretap sets can be arbitrary. Secure…

Information Theory · Computer Science 2016-11-29 Xuan Guang , Raymond W. Yeung

We propose a new secret communication scheme over the bosonic wiretap channel. It uses readily available hardware such as lasers and direct photodetectors. The scheme is based on randomness extractors, pulse-position modulation, and…

Quantum Physics · Physics 2025-12-10 Esther Hänggi , Iyán Méndez Veiga , Ligong Wang
‹ Prev 1 8 9 10 Next ›