English
Related papers

Related papers: Secure Broadcasting Using Independent Secret Keys

200 papers

In this paper, we investigate how constraints on the randomization in the encoding process affect the secrecy rates achievable over wiretap channels. In particular, we characterize the secrecy capacity with a rate-limited local source of…

Information Theory · Computer Science 2012-02-27 Matthieu R. Bloch , Joerg Kliewer

The wiretap channel models secure communication between two users in the presence of an eavesdropper who must be kept ignorant of transmitted messages. The performance of such a system is usually characterized by its secrecy capacity which…

Information Theory · Computer Science 2017-09-07 Holger Boche , Rafael F. Schaefer , H. Vincent Poor

Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by discrete memoryless and i.i.d. channel states and the channel…

Information Theory · Computer Science 2023-06-27 Yiqi Chen , Tobias Oechtering , Mikael Skoglund , Yuan Luo

The capacity of the Gaussian wiretap channel model is analyzed when there are multiple antennas at the sender, intended receiver and eavesdropper. The associated channel matrices are fixed and known to all the terminals. A computable…

Information Theory · Computer Science 2016-11-15 Ashish Khisti , Gregory Wornell

This paper presents two new results on multiple-input multiple-output (MIMO) Gaussian broadcast channels with confidential messages. First, the problem of the MIMO Gaussian wiretap channel is revisited. A matrix characterization of the…

Information Theory · Computer Science 2016-11-15 Ruoheng Liu , Tie Liu , H. Vincent Poor , Shlomo Shamai

This paper considers the problem of secret communication over a multiple access channel with generalized feedback. Two trusted users send independent confidential messages to an intended receiver, in the presence of a passive eavesdropper.…

Information Theory · Computer Science 2016-11-18 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

Fundamental limits of secret-key agreement over reciprocal wireless channels are investigated. We consider a two-way block-fading channel where the channel gains in the forward and reverse links between the legitimate terminals are…

Information Theory · Computer Science 2012-11-08 Ashish Khisti

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, we propose a transmission scheme that achieves information theoretic security, without making assumptions on the eavesdropper's channel. This is achieved by a transmitter that deliberately introduces synchronization errors…

Information Theory · Computer Science 2015-01-27 Jason Castiglione , Aleksandar Kavcic

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

In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second…

Information Theory · Computer Science 2016-07-13 Hassan Zivari-Fard , Bahareh Akhbari , Mahmoud Ahmadian-Attari , Mohammad Reza Aref

Different polar coding schemes are proposed for the memoryless degraded broadcast channel under different reliability and secrecy requirements: layered decoding and/or layered secrecy. In this setting, the transmitter wishes to send…

Information Theory · Computer Science 2018-06-19 Jaume del Olmo , Javier R. Fonollosa

We investigate the construction of weakly-secure index codes for a sender to send messages to multiple receivers with side information in the presence of an eavesdropper. We derive a sufficient and necessary condition for the existence of…

Information Theory · Computer Science 2016-11-17 Lawrence Ong , Badri N. Vellambi , Phee Lep Yeoh , Jörg Kliewer , Jinhong Yuan

Index coding is concerned with efficient broadcast of a set of messages to receivers in the presence of receiver side information. In this paper, we study the secure index coding problem with security constraints on the receivers…

Information Theory · Computer Science 2020-04-16 Yucheng Liu , Parastoo Sadeghi , Neda Aboutorab , Arman Sharififar

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

We introduce a method for securely delivering a set of messages to a group of clients over a broadcast erasure channel where each client is interested in a distinct message. Each client is able to obtain its own message but not the others'.…

Information Theory · Computer Science 2013-05-08 Shahriar Etemadi Tajbakhsh , Parastoo Sadeghi , Rodney Kennedy

Wireless communication is susceptible to eavesdropping attacks because of its broadcast nature. This paper illustrates how interference can be used to counter eavesdropping and assist secrecy. In particular, a wire-tap channel with a…

Information Theory · Computer Science 2016-11-18 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

This paper studies adaptive coding for the two-way wiretap channel. Especially, the strong secrecy metric is of our interest that is defined by the information leakage of transmitted messages to the eavesdropper. First, we consider an…

Information Theory · Computer Science 2024-06-25 Yanling Chen , Masahito Hayashi

The reliability and transmission distance are generally limited for the wireless communications due to the severe channel fading. As an effective way to resist the channel fading, cooperative relaying is usually adopted in wireless networks…

Information Theory · Computer Science 2017-05-19 Hao Niu , Yao Sun , Kaoru Sezaki

The secrecy performance of a source-channel model is studied in the context of lossy source compression over a noisy broadcast channel. The source is causally revealed to the eavesdropper during decoding. The fidelity of the transmission to…

Information Theory · Computer Science 2015-06-24 Eva C. Song , Paul Cuff , H. Vincent Poor
‹ Prev 1 3 4 5 6 7 10 Next ›