English
Related papers

Related papers: The Gaussian Wiretap Channel with a Helping Interf…

200 papers

An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound…

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

This paper considers the problem of filter design with secrecy constraints, where two legitimate parties (Alice and Bob) communicate in the presence of an eavesdropper (Eve), over a Gaussian multiple-input-multiple-output (MIMO) wiretap…

Information Theory · Computer Science 2015-06-15 Hugo Reboredo , João Xavier , Miguel R. D. Rodrigues

In this paper, we consider an intelligent reflecting surface (IRS) assisted Guassian multiple-input multiple-output (MIMO) wiretap channel (WTC), and focus on enhancing its secrecy rate. Due to MIMO setting, all the existing solutions for…

Information Theory · Computer Science 2020-07-29 Limeng Dong , Hui-Ming Wang

An information-theoretic confidential communication is achievable if the eavesdropper has a degraded channel compared to the legitimate receiver. In wireless channels, beamforming and artificial noise can enable such confidentiality.…

Information Theory · Computer Science 2023-12-25 Stefan Roth , Aydin Sezgin

We consider the multiple-input multiple-output (MIMO) wiretap channel under a minimum receiver-side power constraint in addition to the usual maximum transmitter-side power constraint. This problem is motivated by energy harvesting…

Information Theory · Computer Science 2016-11-17 Karim Banawan , Sennur Ulukus

This paper is motivated by a sensor network on a correlated field where nearby sensors share information, and can thus assist rather than interfere with one another. We consider a special class of two-user Gaussian interference channels…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

In coding schemes for the wire-tap channel or the broadcast channels with confidential messages, it is well known that the sender needs to use a stochastic encoding to avoid the information about the transmitted confidential message to be…

Information Theory · Computer Science 2012-06-01 Shun Watanabe , Yasutada Oohama

Secret sharing over the fast-fading MIMO wiretap channel is considered. A source and a destination try to share secret information over a fast-fading MIMO channel in the presence of a wiretapper who also makes channel observations that are…

Information Theory · Computer Science 2009-09-12 Tan F. Wong , Matthieu Bloch , John M. Shea

We consider the wiretap channel model under the presence of a hybrid, half duplex adversary that is capable of either jamming or eavesdropping at a given time. We analyzed the achievable rates under a variety of scenarios involving…

Information Theory · Computer Science 2013-02-01 Y. Ozan Basciftci , C. Emre Koksal , Fusun Ozguner

We consider networks of noisy degraded wiretap channels in the presence of an eavesdropper. For the case where the eavesdropper can wiretap at most one channel at a time, we show that the secrecy capacity region, for a broad class of…

Information Theory · Computer Science 2012-11-20 Theodoros K. Dikaliotis , Hongyi Yao , Tracey Ho , Michelle Effros , Joerg Kliewer

We study the state-dependent wiretap channel with non-causal channel state informations at the encoder in an integrated sensing and communications (ISAC) scenario. In this scenario, the transmitter communicates a message and a state…

Information Theory · Computer Science 2023-07-25 Mehrasa Ahmadipour , Michèle Wigger , Shlomo Shamai

Radio-frequency (RF) signals enabled wireless information and power transfer (WIPT) is a cost-effective technique to achieve two-way communications and at the same time provide energy supplies for low-power wireless devices. However, the…

Information Theory · Computer Science 2017-07-25 Yuan Liu , Jie Xu , Rui Zhang

In this paper, we introduce two new achievable schemes for the fading multiple access wiretap channel (MAC-WT). In the model that we consider, we assume that perfect knowledge of the state of all channels is available at all the nodes in a…

Information Theory · Computer Science 2010-10-29 Raef Bassily , Sennur Ulukus

The two-user multiple-input multiple-output (MIMO) Gaussian broadcast channel (BC) with common, private and confidential messages is considered. The transmitter sends a common message to both users, a confidential message to User 1 and a…

Information Theory · Computer Science 2019-05-29 Ziv Goldfeld , Haim H. Permuter

In this work, we consider a K-user Gaussian wiretap multiple-access channel (GW-MAC) in which each transmitter has an independent confidential message for the receiver. There is also an external eavesdropper who intercepts the…

Information Theory · Computer Science 2015-10-06 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos

The communication scenario under consideration in this paper corresponds to a multiuser channel with side information and consists of a broadcast channel with two legitimate receivers and an eavesdropper. Mainly, the results obtained are as…

Information Theory · Computer Science 2012-10-24 Maël Le Treust , Abdellatif Zaidi , Samson Lasaulce

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

Covert wireless communication can prevent an adversary from knowing the existence of user's transmission, thus provide stronger security protection. In AWGN channels, a square root law was obtained and the result shows that Alice can…

Information Theory · Computer Science 2018-05-17 Zhihong Liu , Jiajia Liu , Yong Zeng , Jianfeng Ma , Qiping Huang

This paper establishes inner bounds on the secrecy capacity regions for the general 3-receiver broadcast channel with one common and one confidential message sets. We consider two setups. The first is when the confidential message is to be…

Information Theory · Computer Science 2011-06-21 Yeow-Khiang Chia , Abbas El Gamal

Covert communications hide the transmission of a message from a watchful adversary while ensuring a certain decoding performance at the receiver. In this work, a wireless communication system under fading channels is considered where…

Information Theory · Computer Science 2018-10-17 Khurram Shahzad , Xiangyun Zhou , Shihao Yan , Jinsong Hu , Feng Shu , Jun Li
‹ Prev 1 4 5 6 7 8 10 Next ›