English
Related papers

Related papers: On Secrecy Capacity of Binary Beampointing Channel…

200 papers

The cognitive interference channel with confidential messages is studied. Similarly to the classical two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at the two…

Information Theory · Computer Science 2007-10-11 Yingbin Liang , Anelia Somekh-Baruch , H. Vincent Poor , Shlomo Shamai , Sergio Verdu

In this paper, we consider multiuser multiple-input single-output (MISO) interference channel where the received signal is divided into two parts for information decoding and energy harvesting (EH), respectively. The transmit beamforming…

Information Theory · Computer Science 2022-10-17 Ming-Min Zhao , Yunlong Cai , Qingjiang Shi , Benoit Champagne , Min-Jian Zhao

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

This work concerns the behavior of "good" (capacity achieving) codes in several multi-user settings in the Gaussian regime, in terms of their minimum mean-square error (MMSE) behavior. The settings investigated in this context include the…

Information Theory · Computer Science 2015-02-26 Ronit Bustin , Rafael F. Schaefer , H. Vincent Poor , Shlomo Shamai

This paper concerns maximizing the minimum achievable secrecy rate of a two-way relay network in the presence of an eavesdropper, in which two nodes aim to exchange messages in two hops, using a multi-antenna relay. Throughout the first…

Information Theory · Computer Science 2017-06-13 Erfan khordad , Soroush Akhlaghi , Meysam Mirzaee

We derive a lower and upper bound on the reliability function of discrete memoryless multiple-access channel (MAC) with noiseless feedback and variable-length codes (VLCs). For the upper-bound, we use proof techniques of Burnashev for the…

Information Theory · Computer Science 2018-07-02 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

In this paper, we investigate the physical-layer security for a spatial modulation (SM) based indoor visible light communication (VLC) system, which includes multiple transmitters, a legitimate receiver, and a passive eavesdropper (Eve). At…

Information Theory · Computer Science 2019-06-25 Jin-Yuan Wang , Hong Ge , Min Lin , Jun-Bo Wang , Jianxin Dai , Mohamed-Slim Alouini

We consider oblivious transfer between Alice and Bob in the presence of an eavesdropper Eve when there is a broadcast channel from Alice to Bob and Eve. In addition to the secrecy constraints of Alice and Bob, Eve should not learn the…

Information Theory · Computer Science 2014-04-29 Manoj Mishra , Bikash Kumar Dey , Vinod M. Prabhakaran , Suhas Diggavi

This work addresses private communication with distributed systems in mind. We consider how to best use secret key resources and communication to transmit signals across a system so that an eavesdropper is least capable to act on the…

Cryptography and Security · Computer Science 2015-03-19 Paul Cuff

We consider the transmission of nonexponentially many messages through a binary symmetric channel with noiseless feedback. We obtain an upper bound for the best decoding error exponent. Combined with the corresponding known lower bound,…

Information Theory · Computer Science 2022-10-14 Marat V. Burnashev

This work models a secure integrated sensing and communication (ISAC) system as a wiretap channel with action-dependent channel states and channel output feedback, e.g., obtained through reflections. The transmitted message is split into a…

Information Theory · Computer Science 2024-08-27 Truman Welling , Onur Günlü , Aylin Yener

We propose a location-based beamforming scheme for wiretap channels, where a source communicates with a legitimate receiver in the presence of an eavesdropper. We assume that the source and the eavesdropper are equipped with multiple…

Information Theory · Computer Science 2015-10-30 Chenxi Liu , Robert Malaney

While semantic communication (SemCom) improves transmission efficiency by focusing on task-relevant information, it also raises critical privacy concerns. Many existing secure SemCom approaches rely on restrictive or impractical…

Cryptography and Security · Computer Science 2026-04-24 Weixuan Chen , Qianqian Yang , Shuo Shao , Shunpu Tang , Zhiguo Shi , Shui Yu

The physical-layer security issue in the multiple non-regenerative wireless-powered relay (WPR) networks is investigated in this letter, where the idle relay is treated as a potential eavesdropper. To guarantee secure communication, the…

Information Theory · Computer Science 2015-07-08 Mingxiong Zhao , Xiangfeng Wang , Suili Feng

We study the secrecy capacity of a helper-assisted Gaussian wiretap channel with a source, a legitimate receiver, an eavesdropper and an external helper, where each terminal is equipped with multiple antennas. Determining the secrecy…

Information Theory · Computer Science 2015-09-16 Lingxiang Li , Zhi Chen , Jun Fang , and Athina P. Petropulu

In cellular systems, confidentiality of uplink transmission with respect to eavesdropping terminals can be ensured by creating intentional inteference via scheduling of concurrent downlink transmissions. In this paper, this basic idea is…

Information Theory · Computer Science 2008-05-06 Petar Popovski , Osvaldo Simeone

Despite the significant interests and many progresses in decentralized multi-player multi-armed bandits (MP-MAB) problems in recent years, the regret gap to the natural centralized lower bound in the heterogeneous MP-MAB setting remains…

Machine Learning · Statistics 2021-11-02 Chengshuai Shi , Wei Xiong , Cong Shen , Jing Yang

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

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO…

Information Theory · Computer Science 2009-10-19 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

This paper analyzes the stochastic security performance of a multiple-input multiple-output (MIMO) integrated sensing and communication (ISAC) system in a downlink scenario. A base station (BS) transmits a multi-functional signal to…

Information Theory · Computer Science 2025-04-15 Marziyeh Soltani , Mahtab Mirmohseni , Rahim Tafazolli
‹ Prev 1 8 9 10 Next ›