中文
相关论文

相关论文: Covert Communication over Physically-Degraded Alar…

200 篇论文

We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the…

信息论 · 计算机科学 2015-03-17 Alexandre J. Pierrot , Matthieu R. Bloch

We study the fundamental limits of covert communications over general memoryless additive-noise channels. We assume that the legitimate receiver and the eavesdropper share the same channel and therefore see the same outputs. Under mild…

信息论 · 计算机科学 2024-12-24 Cécile Bouette , Laura Luzzi , Ligong Wang

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…

信息论 · 计算机科学 2017-06-23 Mengfan Zheng , Meixia Tao , Wen Chen , Cong Ling

This paper investigates the fundamental performance limits of the two-user interference channel in the presence of an external eavesdropper. In this setting, we construct an inner bound, to the secrecy capacity region, based on the idea of…

信息论 · 计算机科学 2015-03-13 O. Ozan Koyluoglu , Hesham El Gamal

In this paper, we consider fundamental communication limits over a compound channel. Covert communication in the information-theoretic context has been primarily concerned with fundamental limits when the transmitter wishes to communicate…

信息论 · 计算机科学 2019-06-18 Sadaf Salehkalaibar , Mohammad Hossein Yassaee , Vincent Y. F. Tan

Most practical communication links are bi-directional. In these models, since the source node also receives signals, its encoder has the option of computing its output based on the signals it received in the past. On the other hand, from a…

信息论 · 计算机科学 2009-11-24 Xiang He , Aylin Yener

Suppose that a transmitter Alice potentially wishes to communicate with a receiver Bob over an adversarially jammed binary channel. An active adversary James eavesdrops on their communication over a binary symmetric channel (BSC(q)), and…

信息论 · 计算机科学 2021-06-25 Qiaosheng Zhang , Mayank Bakshi , Sidharth Jaggi

We consider the problem of covert communication with random slot selection over binary-input Discrete Memoryless Channels and Additive White Gaussian Noise channels, in which a transmitter attempts to reliably communicate with a legitimate…

信息论 · 计算机科学 2025-07-21 Shi-Yuan Wang , Keerthi S. K. Arumugam , Matthieu R. Bloch

We analyze a two-receiver binary-input discrete memoryless broadcast channel, in which the transmitter communicates a common message simultaneously to both receivers and a covert message to only one of them. The unintended recipient of the…

信息论 · 计算机科学 2018-08-30 Keerthi Suria Kumar Arumugam , Matthieu R. Bloch

In this paper, we study covert communications between {a pair of} legitimate transmitter-receiver against a watchful warden over slow fading channels. There coexist multiple friendly helper nodes who are willing to protect the covert…

信息论 · 计算机科学 2021-05-13 Tong-Xing Zheng , Ziteng Yang , Chao Wang , Zan Li , Jinhong Yuan , Xiaohong Guan

We study the security of communication between a single transmitter and multiple receivers in a broadcast channel in the presence of an eavesdropper. We consider several special classes of channels. As the first model, we consider the…

信息论 · 计算机科学 2008-12-02 Ersen Ekrem , Sennur Ulukus

Wireless systems are of paramount importance for providing ubiquitous data transmission for smart cities. However, due to the broadcasting and openness of wireless channels, such systems face potential security challenges. UAV-assisted…

密码学与安全 · 计算机科学 2024-03-15 Chan Gao , Linying Tian , Dong Zheng

We consider the problem of covert communication over a state-dependent channel when the channel state is available either non-causally, causally, or strictly causally, either at the transmitter alone or at both transmitter and receiver.…

信息论 · 计算机科学 2021-05-24 Hassan ZivariFard , Matthieu R. Bloch , Aria Nosratinia

In this paper, the problem of secret key agreement in state-dependent multiple access channels with an eavesdropper is studied. For this model, the channel state information is non-causally available at the transmitters; furthermore, a…

密码学与安全 · 计算机科学 2013-01-23 Mohsen Bahrami , Ali Bereyhi , Mahtab Mirmohseni , Mohammad Reza Aref

A covert communication system under block fading channels is considered where users experience uncertainty about their channel knowledge. The transmitter seeks to hide the covert communication to a private user by exploiting a legitimate…

信息论 · 计算机科学 2017-03-08 Khurram Shahzad , Xiangyun Zhou , Shihao Yan

In this paper, the one-sided secrecy of two-way wiretap channel with feedback is investigated, where the confidential messages of one user through multiple transmissions is guaranteed secure against an external eavesdropper. For one thing,…

信息论 · 计算机科学 2017-07-20 Chao Qi , Yanling Chen , A. J. Han Vinck , Xiaohu Tang

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and…

信息论 · 计算机科学 2025-09-29 Amir Reza Ramtin , Dennis Goeckel , Don Towsley

Spectrum access is an important function of cognitive radios for detecting and utilizing spectrum holes without interfering with the legacy systems. In this paper we propose novel cooperative communication models and show how deploying such…

信息论 · 计算机科学 2009-05-28 Ali Tajer , Xiaodong Wang

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless…

信息论 · 计算机科学 2008-07-30 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

In this paper, we study the degraded compound multi-receiver wiretap channel. The degraded compound multi-receiver wiretap channel consists of two groups of users and a group of eavesdroppers, where, if we pick an arbitrary user from each…

信息论 · 计算机科学 2009-10-19 Ersen Ekrem , Sennur Ulukus
‹ 上一页 1 2 3 10 下一页 ›