English
Related papers

Related papers: Individual secrecy for broadcast channels with rec…

200 papers

We study the problem of generating a shared secret key between two terminals in a joint source-channel setup -- the sender communicates to the receiver over a discrete memoryless wiretap channel and additionally the terminals have access to…

Information Theory · Computer Science 2016-11-18 Ashish Khisti , Suhas Diggavi , Gregory Wornell

This paper considers the problem of simultaneously communicating two messages, a high-security message and a low-security message, to a legitimate receiver, referred to as the security embedding problem. An information-theoretic formulation…

Information Theory · Computer Science 2011-02-09 Hung D. Ly , Tie Liu , Yufei Blankenship

We consider a discrete memoryless broadcast channel consists of two users and a sender. The sender has two independent confidential messages for each user. We extend the work of Liu et al.\ on broadcast channels with two confidential…

Information Theory · Computer Science 2016-02-02 Igor Bjelakovic , Jafar Mohammadi , Sławomir Stańczak

In this paper we consider the secure transmission over the fast fading multiple antenna Gaussian broadcast channels with confidential messages (FMGBC-CM), where a multiple-antenna transmitter sends independent confidential messages to two…

Information Theory · Computer Science 2012-06-26 Pin-Hsun Lin , Chien-Li Su , Hsuan-Jung Su

A class of cognitive interference channel with state is investigated, in which two transmitters (transmitters 1 and 2) communicate with two receivers (receivers 1 and 2) over an interference channel. The two transmitters jointly transmit a…

Information Theory · Computer Science 2012-07-10 Ruchen Duan Yingbin Liang

We consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, "covert" means that a warden on the channel should observe similar…

Information Theory · Computer Science 2017-08-09 Si-Hyeon Lee , Ligong Wang , Ashish Khisti , Gregory W. Wornell

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-01-21 Mustafa Cenk Gursoy

The problem of secure source coding with multiple terminals is extended by considering a remote source whose noisy measurements are the correlated random variables used for secure source reconstruction. The main additions to the problem…

Information Theory · Computer Science 2022-11-10 Onur Günlü , Rafael F. Schaefer , Holger Boche , H. Vincent Poor

We consider the MIMO wiretap channel, that is a MIMO broadcast channel where the transmitter sends some confidential information to one user which is a legitimate receiver, while the other user is an eavesdropper. Perfect secrecy is…

Information Theory · Computer Science 2007-10-11 Frédérique Oggier , Babak Hassibi

In this paper, the fading broadcast channel with confidential messages is studied in the presence of statistical quality of service (QoS) constraints in the form of limitations on the buffer length. We employ the effective capacity…

Information Theory · Computer Science 2010-04-07 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

This paper studies the frequency/time selective $K$-user Gaussian interference channel with secrecy constraints. Two distinct models, namely the interference channel with confidential messages and the one with an external eavesdropper, are…

Information Theory · Computer Science 2016-11-17 Onur Ozan Koyluoglu , Hesham El Gamal , Lifeng Lai , H. Vincent Poor

Harnessing a block-sparse prior to recover signals through underdetermined linear measurements has been extensively shown to allow exact recovery in conditions where classical compressed sensing would provably fail. We exploit this result…

Information Theory · Computer Science 2021-10-12 Maxime Ferreira Da Costa , Urbashi Mitra

We study the multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter…

Information Theory · Computer Science 2011-06-22 Ersen Ekrem , Sennur Ulukus

We study the Gaussian multiple-input multiple-output (MIMO) wiretap channel, which consists of a transmitter, a legitimate user, and an eavesdropper. In this channel, the transmitter sends a common message to both the legitimate user and…

Information Theory · Computer Science 2010-05-05 Ersen Ekrem , Sennur Ulukus

The problem of secure lossy source-channel wiretapping with arbitrarily correlated side informations at both receivers is investigated. This scenario consists of an encoder (referred to as Alice) that wishes to compress a source and send it…

Information Theory · Computer Science 2011-10-11 Joffrey Villard , Pablo Piantanida , Shlomo Shamai

We consider the secure communication problem for broadcasting of two encrypted sources. The sender wishes to broadcast two secret messages via two common key cryptosystems. We assume that the adversary can use the side-channel, where the…

Information Theory · Computer Science 2019-06-26 Bagus Santoso , Yasutada Oohama

We study a lossy source coding problem with secrecy constraints in which a remote information source should be transmitted to a single destination via multiple agents in the presence of a passive eavesdropper. The agents observe noisy…

Information Theory · Computer Science 2015-02-19 Farshad Naghibi , Somayeh Salimi , Mikael Skoglund

This paper studies the value of limited rate cooperation between the transmitters for managing interference and simultaneously ensuring secrecy, in the 2-user Gaussian symmetric interference channel (GSIC). First, the problem is studied in…

Information Theory · Computer Science 2016-06-14 Parthajit Mohapatra , Chandra R. Murthy

A new applicable wiretap channel with separated side information is considered here which consist of a sender, a legitimate receiver and a wiretapper. In the considered scenario, the links from the transmitter to the legitimate receiver and…

Information Theory · Computer Science 2012-04-03 Hamid G. Bafghi , Babak Seyfe , Mahtab Mirmohseni , M. Reza Aref

We study the secrecy capacity in the vicinity of colluding eavesdroppers. Contrary to the perfect collusion assumption in previous works, our new information-theoretic model considers constraints in collusion. We derive the achievable…

Information Theory · Computer Science 2013-12-12 Mahtab Mirmohseni , Panagiotis Papadimitratos
‹ Prev 1 4 5 6 7 8 10 Next ›