English
Related papers

Related papers: Secure Broadcasting Using Independent Secret Keys

200 papers

We consider a scenario in which $K$ transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless MAC while simultaneously escaping detection from an adversary who observes their…

Information Theory · Computer Science 2019-06-11 Keerthi Suria Kumar Arumugam , Matthieu R. Bloch

We study private broadcasting of two messages to two groups of receivers over independent parallel channels. One group consists of an arbitrary number of receivers interested in a common message, whereas the other group has only one…

Information Theory · Computer Science 2013-01-01 Ashish Khisti , Tie Liu

This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent messages, each of which is intended for one of the receivers…

Information Theory · Computer Science 2009-03-24 Ruoheng Liu , Tie Liu , H. Vincent Poor , Shlomo Shamai

We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers with…

Information Theory · Computer Science 2016-11-15 Ruoheng Liu , Ivana Maric , Predrag Spasojevic , Roy D. Yates

We investigate the problem of information theoretically secure communication in a line network with erasure channels and state feedback. We consider a spectrum of cases for the private randomness that intermediate nodes can generate,…

Information Theory · Computer Science 2014-07-09 Athanasios Papadopoulos , Laszlo Czap , Christina Fragouli

Information-theoretically secure communications are possible when channel noise is usable and when the channel has an intrinsic characteristic that a legitimate receiver (Bob) can use the noise more advantageously than an eavesdropper…

Cryptography and Security · Computer Science 2018-03-15 Tatsuya Tomaru

We study the problem of securely estimating the states of an unstable dynamical system subject to nonstochastic disturbances. The estimator obtains all its information through an uncertain channel which is subject to nonstochastic…

We consider the problem of secure communication with multi-antenna transmission in fading channels. The transmitter simultaneously transmits an information bearing signal to the intended receiver and artificial noise to the eavesdroppers.…

Information Theory · Computer Science 2010-07-01 Xiangyun Zhou , Matthew R. McKay

Motivated in part by the problem of secure multicast distributed storage, we analyze secrecy rates for a channel in which two transmitters simultaneously multicast to two receivers in the presence of an eavesdropper. Achievable rates are…

Information Theory · Computer Science 2020-08-04 Hassan ZivariFard , Matthieu Bloch , Aria Nosratinia

In Private Broadcasting, a single plaintext is broadcast to multiple recipients in an encrypted form, such that each recipient can decrypt locally. When the message is classical, a straightforward solution is to encrypt the plaintext with a…

Quantum Physics · Physics 2022-02-23 Anne Broadbent , Carlos E. González-Guillén , Christine Schuknecht

We study the fundamental problem of index coding under an additional privacy constraint that requires each receiver to learn nothing more about the collection of messages beyond its demanded messages from the server and what is available to…

Information Theory · Computer Science 2020-06-02 Varun Narayanan , Jithin Ravi , Vivek K. Mishra , Bikash Kumar Dey , Nikhil Karamchandani , Vinod M. Prabhakaran

The 2-receiver broadcast channel is studied: a network with three parties where the transmitter and one of the receivers are the primarily involved parties and the other receiver considered as third party. The messages that are determined…

Information Theory · Computer Science 2019-03-12 Farzin Salek , Min-Hsiu Hsieh , Javier R. Fonollosa

In this work, we investigate the problem of secure broadcasting over block-fading wiretap channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having a finite rate feedback on the…

Information Theory · Computer Science 2020-04-22 Amal Hyadi , Zouheir Rezki , Mohamed-Slim Alouini

A broadcast channel (BC) where the decoders cooperate via a one-sided link is considered. One common and two private messages are transmitted and the private message to the cooperative user should be kept secret from the cooperation-aided…

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

In this paper, we consider the transmission of confidential messages over slow fading wireless channels in the presence of an eavesdropper. We propose a transmission scheme that employs a single reconfigurable antenna at each of the…

Information Theory · Computer Science 2014-02-06 Ahmed M. Alaa

In this paper, secure transmission of information over fading broadcast channels is studied in the presence of statistical queueing constraints. Effective capacity is employed as a performance metric to identify the secure throughput of the…

Information Theory · Computer Science 2010-12-02 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

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

Traditional cryptography assumes an eavesdropper receives an error-free copy of the transmitted ciphertext. Wyner's wiretap channel model recognizes that at the physical layer both the intended receiver and the passive eavesdropper…

Information Theory · Computer Science 2015-09-24 Willie K Harrison , Steven W. McLaughlin

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, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-IC with secrecy…

Information Theory · Computer Science 2021-05-20 Somalatha U , Parthajit Mohapatra