English
Related papers

Related papers: A Model for Adversarial Wiretap Channel

200 papers

We consider a block fading wiretap channel, where a transmitter attempts to send messages securely to a receiver in the presence of a hybrid half-duplex adversary, which arbitrarily decides to either jam or eavesdrop the transmitter-to-…

Information Theory · Computer Science 2013-12-03 Y. Ozan Basciftci , Onur Gungor , C. Emre Koksal , Fusun Ozguner

We study the Gaussian MIMO wiretap channel with a transmitter, a legitimate receiver, an eavesdropper and an external helper, each equipped with multiple antennas. The transmitter sends confidential messages to its intended receiver, while…

Information Theory · Computer Science 2015-05-27 S. Ali. A. Fakoorian , A. Lee Swindlehurst

Several security models of multiple-access channel (MAC) are investigated. First, we study the degraded MAC with confidential messages, where two users transmit their confidential messages (no common message) to a destination, and each user…

Information Theory · Computer Science 2013-01-01 Bin Dai , A. J. Han Vinck , Zhuojun Zhuang , Yuan Luo

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

The wiretap channel is a setting where one aims to provide information-theoretic privacy of communicated data based solely on the assumption that the channel from sender to adversary is "noisier" than the channel from sender to receiver. It…

Information Theory · Computer Science 2015-03-20 Mihir Bellare , Stefano Tessaro , Alexander Vardy

This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes…

Information Theory · Computer Science 2010-04-13 O. Ozan Koyluoglu , C. Emre Koksal , Hesham El Gamal

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

The theory of quantum cryptography aims to guarantee unconditional information-theoretic security against an omnipotent eavesdropper. In many practical scenarios, however, the assumption of an all-powerful adversary is excessive and can be…

In this paper, we propose an algorithm that targets contamination and eavesdropping adversaries. We consider the case when the number of independent packets available to the eavesdropper is less than the multicast capacity of the network.…

Cryptography and Security · Computer Science 2008-05-16 Yejun Zhou , Hui Li , Jianfeng Ma

This paper considers the secrecy transmission in a large-scale unmanned aerial vehicle (UAV)-enabled wireless network, in which a set of UAVs in the sky transmit confidential information to their respective legitimate receivers on the…

Information Theory · Computer Science 2019-08-13 Jianping Yao , Jie Xu

Polar codes have been proven to be capacity achieving for any binary-input discrete memoryless channel, while at the same time they can reassure secure and reliable transmission over the single-input single-output wireless channel. However,…

This paper investigates reliable and covert transmission strategies in a multiple-input multiple-output (MIMO) wiretap channel with a transmitter, receiver and an adversarial wiretapper, each equipped with multiple antennas. In a departure…

Information Theory · Computer Science 2016-11-15 Amitav Mukherjee , A. Lee Swindlehurst

This paper investigates the capacity region of a discrete memoryless (DM) multiple access wiretap (MAC-WT) channel where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the…

Information Theory · Computer Science 2020-01-14 Hao Xu , Giuseppe Caire , Cunhua Pan

We give a complete characterization of the correlated random coding secrecy capacity of arbitrarily varying wiretap channels (AVWCs). We apply two alternative strong secrecy criteria, which both lead to the same multi-letter formula. The…

Information Theory · Computer Science 2016-11-17 Moritz Wiese , Janis Nötzel , Holger Boche

In this work, an explicit wiretap coding scheme based on polar lattices is proposed to achieve the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel. Firstly, polar lattices are used to construct secrecy-good…

Information Theory · Computer Science 2017-12-27 Ling Liu , Yanfei Yan , Cong Ling

This work establishes that the physical layer can be used to perform information-theoretic authentication in additive white Gaussian noise channels, as long as the adversary is not omniscient. The model considered consists of an encoder,…

Information Theory · Computer Science 2021-11-12 Eric Graves , Allison Beemer , Jorg Kliewer , Oliver Kosut , Paul Yu

In this paper, we study a model of communication under adversarial noise. In this model, the adversary makes online decisions on whether to corrupt a transmitted bit based on only the value of that bit. Like the usual binary symmetric…

Information Theory · Computer Science 2014-01-21 Arya Mazumdar

A wiretap protocol is a pair of randomized encoding and decoding functions such that knowledge of a bounded fraction of the encoding of a message reveals essentially no information about the message, while knowledge of the entire encoding…

Information Theory · Computer Science 2011-07-26 Mahdi Cheraghchi , Frederic Didier , Amin Shokrollahi

This work considers the two-way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and…

Information Theory · Computer Science 2011-10-04 Aly El Gamal , O. Ozan Koyluoglu , Moustafa Youssef , Hesham El Gamal

We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by…

Information Theory · Computer Science 2016-11-17 Igor Bjelakovic , Holger Boche , Jochen Sommerfeld
‹ Prev 1 4 5 6 7 8 10 Next ›