نتایج جستجو برای: secrecy capacity

تعداد نتایج: 282274  

Journal: :CoRR 2015
Ahmed S. Mansour Rafael F. Schaefer Holger Boche

This paper considers a three-receiver broadcast channel with degraded message sets and message cognition. The model consists of a common message for all three receivers, a private common message for only two receivers and two additional private messages for these two receivers, such that each receiver is only interested in one message, while being fully cognizant of the other one. First, this m...

2016
Kyusung Shim Nhu Tri Do Beongku An

In this paper, we study physical layer security (PLS) of wireless networks in presence of one eavesdropper. Assume that the channel state information (CSI) of the eavesdropper cannot be obtained at the transmitter, such as CSI can be then estimated through the CSI of a torch node. In addition, a practical issue of wireless nodes, i.e., hardware impairment (HI), is considered at the source node ...

Journal: :Entropy 2014
Bin Dai Zheng Ma

In this paper, some new results on the multiple-access wiretap channel (MAC-WT) are provided. Specifically, first, we investigate the degraded MAC-WT, where two users transmit their corresponding confidential messages (no common message) to a legitimate receiver via a multiple-access channel (MAC), while a wiretapper wishes to obtain the messages via a physically degraded wiretap channel. The s...

Journal: :IEEE Transactions on Information Theory 2013

Journal: :CoRR 2016
Parthajit Mohapatra Chandra R. Murthy Jemin Lee

This paper derives outer bounds on the secrecy capacity region of the 2-user Z interference channel (Z-IC) with rate-limited unidirectional cooperation between the transmitters. First, the model is studied under the linear deterministic setting. The derivation of the outer bounds on the secrecy capacity region involves careful selection of the side information to be provided to the receivers an...

2008
Ashish Khisti

The Gaussian wiretap channel model is studied when there are multiple antennas at the sender, the receiver and the eavesdropper and the channel matrices are fixed and known to all the terminals. The secrecy capacity is characterized using a Sato type upper bound. A computable characterization of the capacity is provided. The secrecy capacity is studied in several interesting regimes. The high S...

2012
Mohammad Rakibul Islam

In this paper, a Gaussian multiple input multiple output multiple eavesdropper (MIMOME) channel is considered where a transmitter communicates to a receiver in the presence of an eavesdropper. We present a technique for determining the secrecy capacity of the multiple input multiple output (MIMO) channel under Gaussian noise. We transform the degraded MIMOME channel into multiple single input m...

Journal: :CoRR 2006
Ender Tekin Aylin Yener

We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper who is as capable as the intended receiver, but has different channel parameters. We aim to provide perfect secrecy for the transmitters in this multi-access environment. Using Gaussian co...

Journal: :CoRR 2018
Sarah Kamel Mireille Sarkiss Michele A. Wigger Ghaya Rekaya-Ben Othman

This paper derives upper and lower bounds on the secrecy capacity-memory tradeoff of a wiretap erasure broadcast channel (BC) with Kw weak receivers and Ks strong receivers, where weak receivers, respectively strong receivers, have same erasure probabilities and cache sizes. The lower bounds are achieved by schemes that meticulously combine joint cache-channel coding with wiretap coding and key...

Journal: :Probl. Inf. Transm. 2013
Igor Bjelakovic Holger Boche Jochen Sommerfeld

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 Liang et al. and thus establishing a full coding theorem in this case. We achieve this with a stronger secrecy criterion and the maximum error probability crit...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید