中文
相关论文

相关论文: Covert Wireless Communication with a Poisson Field…

200 篇论文

The ability to exchange secret information is critical to many commercial, governmental, and military networks. The intrinsically secure communications graph (iS-graph) is a random graph which describes the connections that can be securely…

信息论 · 计算机科学 2010-08-26 Pedro C. Pinto , Moe Z. Win

Wireless covert channels promise to exfiltrate information with high bandwidth by circumventing traditional access control mechanisms. Ideally, they are only accessible by the intended recipient and---for regular system…

网络与互联网体系结构 · 计算机科学 2015-05-06 Jiska Classen , Matthias Schulz , Matthias Hollick

This paper investigates the covert communication in an air-to-ground (A2G) system, where a UAV (Alice) can adopt the omnidirectional microwave (OM) or directional mmWave (DM) transmission mode to transmit covert data to a ground user (Bob)…

信息论 · 计算机科学 2023-02-02 Wenhao Zhang , Ji He , Yulong Shen , Xiaohong Jiang

In this paper, we study the performance, in terms of the asymptotic error probability, of a user which communicates with a destination with the aid of a full-duplex in-band relay. We consider that the network is interference-limited, and…

信息论 · 计算机科学 2014-05-16 Andres Altieri , Leonardo Rey Vega , Pablo Piantanida , Cecilia G. Galarza

We show that the problem of analyzing the outage probability in cellular systems affected by co-channel interference and background noise is mathematically equivalent to the problem of analyzing the wireless information-theoretic security…

信息论 · 计算机科学 2016-11-17 Gerardo Gomez , F. Javier Lopez-Martinez , David Morales-Jimenez , Matthew R. McKay

This paper studies covert communication over channels with ADSI when the state is available either non-causally or causally at the transmitter. Covert communication refers to reliable communication between a transmitter and a receiver while…

信息论 · 计算机科学 2025-01-24 Hassan ZivariFard , Xiaodong Wang

We obtain strict upper bounds on the bit transmission rate for communication of Classical bit codewords over Quantum channels. Albeit previous arguments in arXiv: 1804.01797 which have demonstrated that lower bounds can be shown to hold for…

量子物理 · 物理学 2025-07-08 Pete Rigas

Interference between nodes is a critical impairment in mobile ad hoc networks (MANETs). This paper studies the role of multiple antennas in mitigating such interference. Specifically, a network is studied in which receivers apply…

信息论 · 计算机科学 2012-08-27 Kaibin Huang , Jeffrey G. Andrews , Dongning Guo , Robert W. Heath, , Randall A. Berry

This paper studies the K-user Gaussian interference channel with secrecy constraints. Two distinct network models, namely the interference channel with confidential messages and the one with an external eavesdropper, are analyzed. Using…

信息论 · 计算机科学 2016-11-15 Onur Ozan Koyluoglu , Hesham El Gamal , Lifeng Lai , H. Vincent Poor

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, the compression of an independent and identically distributed Gaussian source sequence is studied in an unsecure network. Within a game theoretic setting for a three-party noiseless communication network (sender Alice,…

密码学与安全 · 计算机科学 2013-07-30 Eva C. Song , Paul Cuff , H. Vincent Poor

A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure communication in the presence of eavesdroppers is possible. The…

信息论 · 计算机科学 2016-11-15 Martin Haenggi

We study the covert communication over K-user discrete memoryless interference channels (DM-ICs) with a warden. It is assumed that the warden's channel output distribution induced by K "off" input symbols, which are sent when no…

信息论 · 计算机科学 2020-03-11 Kang-Hee Cho , Si-Hyeon Lee

In the Conditional Disclosure of Secrets (CDS) problem, Alice and Bob hold inputs $x\in \mathcal{X}$ and $y\in \mathcal{Y}$ and share a secret. Let $f:\mathcal{X}\times\mathcal{Y}\to\{0,1\}$ be a function such that the secret is revealed to…

信息论 · 计算机科学 2025-12-19 Zhou Li , Siyan Qin , Xiang Zhang , Jihao Fan , Haiqiang Chen , Giuseppe Caire

The amount of sensitive data, which is transmitted wirelessly will increase with future technologies. This raises many questions about secure data transmission. Besides cryptography, information-theoretic security gained increasing…

信息论 · 计算机科学 2021-01-18 Karl-Ludwig Besser , Eduard A. Jorswieck

In this paper, new inner and outer bounds on the achievable compression-equivocation rate region for generalized secure data compression with side information are given that do not match in general. In this setup, two senders, Alice and…

信息论 · 计算机科学 2010-04-07 Somayeh Salimi , Mahmoud Salmasizadeh , Mohammad Reza Aref

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

Radio-frequency (RF) signals enabled wireless information and power transfer (WIPT) is a cost-effective technique to achieve two-way communications and at the same time provide energy supplies for low-power wireless devices. However, the…

信息论 · 计算机科学 2017-07-25 Yuan Liu , Jie Xu , Rui Zhang

In this work, we consider a scenario where two multiple-aperture legitimate nodes (Alice and Bob) communicate by means of Free-Space Optical (FSO) communication in the presence of a multiple-aperture eavesdropper (Eve), which is subject to…

Interference is a major issue limiting the performance in wireless networks. Cooperation among receivers can help mitigate interference by forming distributed MIMO systems. The rate at which receivers cooperate, however, is limited in most…

信息论 · 计算机科学 2009-11-12 I-Hsiang Wang , David N. C. Tse