Related papers: A Simple Evaluation for the Secrecy Outage Probabi…
In slow fading scenarios, cooperation between nodes can increase the amount of diversity for communication. We study the performance limit in such scenarios by analyzing the outage capacity of slow fading relay channels. Our focus is on the…
In this paper, the physical layer security (PLS) for a novel reconfigurable intelligent surface (RIS)-assisted non-orthogonal multiple access (NOMA) system in a multi-user scenario is investigated, where we consider the worst case that the…
In this paper, the performance of signaling strategies with high peak-to-average power ratio is analyzed in both coherent and noncoherent fading channels. Two recently proposed modulation schemes, namely on-off binary phase-shift keying and…
In this work, we analyze the secrecy outage performance of a dual-hop relay system composed of multiple-input-multiple-output radio-frequency (RF) links and a free-space optical (FSO) link while a multiple-antenna eavesdropper wiretaps the…
Non-orthogonal multiple access (NOMA) serves multiple users simultaneously via the same resource block by exploiting superposition coding at the transmitter and successive interference cancellation (SIC) at the receivers. Under practical…
We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) by using physical layer security techniques. We assume that…
We propose a new method to protect Over-The-Air (OTA) computation schemes against passive eavesdropping. Our method uses a friendly jammer whose signal is -- contrary to common intuition -- stronger at the legitimate receiver than it is at…
Conventionally, unconditional information security has been studied by quantum cryptography although the assumption of an omnipotent eavesdropper is too strict for some realistic implementations. In this paper, we study the realistic secret…
In this paper, we consider the downlink in a K-tier heterogeneous network in the presence of Nakagami-m fading and noise. For such a system, we derive closed-form approximations of coverage probability and average rate achievable. A…
In this work we consider a generalized version of Probability Smoothing, the core elementary model for sequential prediction in the state of the art PAQ family of data compression algorithms. Our main contribution is a code length analysis…
Semi-grant-free (SGF) transmission scheme enables grant-free (GF) users to utilize resource blocks allocated for grant-based (GB) users while maintaining the quality of service of GB users. This work investigates the secrecy performance of…
This paper investigates the outage performance of overhearing amplify-and-forward (AF) cooperative relaying, where a source transmits information to its destination through multiple helping overhearing AF relays with space-time network…
Several gaps and errors in [1] are identified and corrected. While accommodating these corrections, a rigours proof is given that the successive convex approximation algorithm in [1] for secrecy rate maximization (SRM) does generate an…
We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by…
This paper is devoted to the study of the performance of the Linear Minimum Mean-Square Error receiver for (receive) correlated Multiple-Input Multiple-Output systems. By the random matrix theory, it is well-known that the Signal-to-Noise…
In this paper, we consider an active eavesdropping scenario in a cooperative system consisting of a source, a destination, and an active eavesdropper with multiple decode-and-forward relays. Considering an existing assumption in which an…
The coverage probability and average data rate of normalized SNR-based scheduling in a downlink cellular network are derived by modeling the locations of the base stations and users as two independent Poison point processes. The scheduler…
Ensuring physical-layer security in non-terrestrial networks (NTNs) is challenging due to their global coverage and multi-hop relaying across heterogeneous network layers, where the locations and channels of potential eavesdroppers are…
We study the problem of achieving strong secrecy over wiretap channels at negligible cost, in the sense of maintaining the overall communication rate of the same channel without secrecy constraints. Specifically, we propose and analyze two…
The secrecy capacity of a discrete memoryless Gaussian Wire-Tap Channel when the input is from a finite complex constellation is studied. It is shown that the secrecy capacity curves of a finite constellation plotted against the SNR, for a…