English
Related papers

Related papers: Improved Rate-Equivocation Regions for Secure Coop…

200 papers

In this paper, we want to derive achievable secrecy rate regions for quantum interference channel with classical inputs under one-shot setting. The main idea to this end is to use the combination of superposition and rate splitting for…

Information Theory · Computer Science 2023-01-10 Hadi Aghaee , Bahareh Akhbari

This paper applies Information Theoretic analysis to packet-based random multiple access communication systems. A new channel coding approach is proposed for coding within each data packet with built-in support for bursty traffic…

Information Theory · Computer Science 2016-11-17 Jie Luo , Anthony Ephremides

This paper studies a Gaussian Z-interference channel with a rate-limited digital relay link from one receiver to another. Achievable rate regions are derived based on a combination of Han-Kobayashi common-private information splitting…

Information Theory · Computer Science 2012-04-26 Lei Zhou , Wei Yu

This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes…

Information Theory · Computer Science 2010-04-13 O. Ozan Koyluoglu , C. Emre Koksal , Hesham El Gamal

In this paper, we propose a cooperative approach to improve the security of both primary and secondary systems in cognitive radio multicast communications. During their access to the frequency spectrum licensed to the primary users, the…

Information Theory · Computer Science 2017-07-11 Van-Dinh Nguyen , Trung Q. Duong , Oh-Soon Shin , Arumugam Nallanathan , George K. Karagiannidis

This paper studies secrecy rate optimization in a wireless network with a single-antenna source, a multi-antenna destination and a multi-antenna eavesdropper. This is an unfavorable scenario for secrecy performance as the system is…

Information Theory · Computer Science 2016-08-24 Gan Zheng , Ioannis Krikidis , Jiangyuan Li , Athina P. Petropulu , Bjorn Ottersten

In this paper the secrecy problem in the cognitive statedependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary…

Information Theory · Computer Science 2012-08-23 Hamid G. Bafghi , Babak Seyfe

In this paper, we consider the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multi-antenna base station simultaneously communicates to multiple potentially malicious users, in the presence of…

Information Theory · Computer Science 2013-06-11 Giovanni Geraci , Sarabjot Singh , Jeffrey G. Andrews , Jinhong Yuan , Iain B. Collings

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

Considering a multi-user interference network with an eavesdropper, this paper aims at the power allocation to optimize the worst secrecy throughput among the network links or the secure energy efficiency in terms of achieved secrecy…

Information Theory · Computer Science 2017-08-25 Zhichao Sheng , Hoang Duong Tuan , Ali Arshad Nasir , Trung Q. Duong , H. Vincent Poor

The capacity regions are investigated for two relay broadcast channels (RBCs), where relay links are incorporated into standard two-user broadcast channels to support user cooperation. In the first channel, the Partially Cooperative Relay…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , Venugopal V. Veeravalli

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. We define two suitable secrecy…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener

A novel class of achievable rate regions is obtained for the K-receiver broadcast channel with two groupcast messages. The associated achievability schemes are parameterized by an expansion of the message set which then determines how…

Information Theory · Computer Science 2020-01-28 Mohamed Salman , Mahesh K. Varanasi

This paper brings the novel idea of paying the utility to the winning agents in terms of some physical entity in cooperative communications. Our setting is a secret two-way communication channel where two transmitters exchange information…

Information Theory · Computer Science 2017-03-22 Muhammad R. A. Khandaker , Kai-Kit Wong , Gan Zheng

Semantic communications conveys task-relevant meaning rather than focusing solely on message reconstruction, improving bandwidth efficiency and robustness for next-generation wireless systems. However, learned semantic representations can…

Networking and Internet Architecture · Computer Science 2026-01-01 Yalin E. Sagduyu , Tugba Erpek , Aylin Yener , Sennur Ulukus

We consider a class of Gaussian layered networks where a source communicates with a destination through $L$ intermediate relay layers with $N$ nodes in each layer in the presence of a single eavesdropper which can overhear the transmissions…

Information Theory · Computer Science 2016-07-18 Tulika Agrawal , Samar Agnihotri

A downlink single-input single-output non-orthogonal multiple access setting is considered, in which a base station (BS) is communicating with two legitimate users in two possible scenarios of unsecure environments: existence of an external…

Information Theory · Computer Science 2019-05-13 Ahmed Arafa , Wonjae Shin , Mojtaba Vaezi , H. Vincent Poor

A single-letter achievable rate region is proposed for the two-receiver discrete memoryless broadcast channel with generalized feedback. The coding strategy involves block-Markov superposition coding, using Marton's coding scheme for the…

Information Theory · Computer Science 2014-02-10 Ramji Venkataramanan , S. Sandeep Pradhan

We investigate the problem of secure communications in a Gaussian multi-way relay channel applying the compute-and-forward scheme using nested lattice codes. All nodes employ half-duplex operation and can exchange confidential messages only…

Information Theory · Computer Science 2014-06-24 Johannes Richter , Christian Scheunert , Sabrina Engelmann , Eduard A. Jorswieck

Physical-layer security for wireless networks has become an effective approach and recently drawn significant attention in the literature. In particular, the deployment and allocation of resources such as relays to assist the transmission…

Information Theory · Computer Science 2017-12-29 X. Lu , R. C. de Lamare