English
Related papers

Related papers: On Secrecy Capacity of Binary Beampointing Channel…

200 papers

In this paper, we consider the secrecy capacity of a wiretap channel in the presence of causal state information and secure rate-limited feedback. In this scenario, the causal state information from the channel is available to both the…

Information Theory · Computer Science 2014-08-15 Alejandro Cohen , Asaf Cohen

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

This work considers a layered coding approach for efficient transmission of data over a wireless block fading channel without transmitter channel state information (CSI), which is connected to a limited capacity reliable link, known as the…

Information Theory · Computer Science 2020-05-01 Avi Steiner , Shlomo Shamai

We study covert communications over binary-input discrete memoryless alarm two-way channels, in which two users interact through a two-way channel and attempt to hide the presence of their communication from an eavesdropping receiver. The…

Information Theory · Computer Science 2025-06-23 Tuna Erdoğan , Tyler Kann , Aria Nosratinia , Matthieu Bloch

In the paper, the physical-layer security for reconfigurable intelligent surface (RIS) aided integrated sensing and communication (ISAC) system is studied. There is an active eavesdropper (AE) as well as a passive eavesdropper (PE), and…

Information Theory · Computer Science 2026-05-11 Yueyi Dong , Tian Zhang

This paper presents two different low-complexity methods for obtaining the secrecy capacity of multiple-input multiple-output (MIMO) wiretap channel subject to a sum power constraint (SPC). The challenges in deriving computationally…

Information Theory · Computer Science 2021-02-23 Anshu Mukherjee , Björn Ottersten , Le Nam Tran

In this paper, we investigate the physical layer security of a full-duplex base station (BS) aided system in the worst case, where an uplink transmitter (UT) and a downlink receiver (DR) are both equipped with a single antenna, while a…

Information Theory · Computer Science 2019-04-23 Zhengmin Kong , Shaoshi Yang , Die Wang , Lajos Hanzo

Imperfect secrecy in communication systems is investigated. Instead of using equivocation as a measure of secrecy, the distortion that an eavesdropper incurs in producing an estimate of the source sequence is examined. The communication…

Information Theory · Computer Science 2012-10-09 Curt Schieler , Eva C. Song , Paul Cuff , 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

The secrecy performance in both near-field and far-field communications is analyzed using two fundamental metrics: the secrecy capacity under a power constraint and the minimum power requirement to achieve a specified secrecy rate target.…

Information Theory · Computer Science 2025-04-11 Boqun Zhao , Chongjun Ouyang , Xingqi Zhang , Yuanwei Liu

A continuous aperture array (CAPA)-based secure communication system is investigated, where a base station equipped with a CAPA transmits signals to a legitimate user under the existence of an eavesdropper. For improving the secrecy…

Signal Processing · Electrical Eng. & Systems 2025-04-16 Jingjing Zhao , Haowen Song , Xidong Mu , Kaiquan Cai , Yanbo Zhu , Yuanwei Liu

Strong secrecy capacity of compound wiretap channels is studied. The known lower bounds for the secrecy capacity of compound finite-state memoryless channels under discrete alphabets are extended to arbitrary uncertainty sets and continuous…

Information Theory · Computer Science 2015-09-09 Rafael F. Schaefer , Sergey Loyka

We investigate the effects of an additional relay node on the secrecy of broadcast channels by considering the model of relay broadcast channels with confidential messages. We show that this additional relay node can increase the achievable…

Information Theory · Computer Science 2015-12-09 Bin Dai , Linman Yu , Zheng Ma

We derive upper and lower bounds on the reliability function for the common-message discrete memoryless broadcast channel with variable-length feedback. We show that the bounds are tight when the broadcast channel is stochastically…

Information Theory · Computer Science 2017-01-13 Lan V. Truong , Vincent Y. F. Tan

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

The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , H. Vincent Poor , Shlomo Shamai

We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is…

Information Theory · Computer Science 2007-07-16 Praveen Kumar Gopala , Lifeng Lai , Hesham El Gamal

We study a special case of Willems's two-user multi-access channel with partially cooperating encoders from a security perspective. This model differs from Willems's setup in that only one encoder, Encoder 1, is allowed to conference;…

Information Theory · Computer Science 2016-11-17 Zohaib Hassan Awan , Abdellatif Zaidi , Luc Vandendorpe

We propose and study the cooperative MIMO architecture to enable and to improve the secrecy transmissions between clusters of mobile devices in the presence of an eavesdropper with certain location constraint. The cooperative MIMO system in…

Information Theory · Computer Science 2019-01-08 Zhong Zheng , Zygmunt Haas , Mario Kieburg

The capacity of the semideterministic discrete memoryless broadcast channel (SD-BC) with partial message side-information (P-MSI) at the receivers is established. In the setting without a common message, it is shown that P-MSI to the…

Information Theory · Computer Science 2017-05-30 Annina Bracher , Michèle Wigger
‹ Prev 1 3 4 5 6 7 10 Next ›