skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


This content will become publicly available on May 16, 2026

Title: A Cross-Layer Security Approach for Multi-Node Gaussian Wiretap Channels
In this work, we propose a new approach to examine the joint effect of physical layer security (PhySec) and encryption. Our idea relies on the concept of rate-equivocation regions and can be used to study the tradeoff between encryption strength, allowed leakage, and transmission rate. By considering encryption, it is possible to achieve transmission rates beyond the secrecy capacity that is achievable by conventional physical layer security. Toward our goal, we exploit the fact that cryptography undermines the ability of the eavesdropper to access the plaintext. We then relax the design of physical layer security schemes without compromising the security of the system. To validate our new approach, we consider a multi-node Gaussian wiretap channel consisting of a legitimate transmitter, a legitimate receiver, an eavesdropper and multiple trusted relays assisting transmission from the transmitter to the receiver. Under this wireless network, we illustrate that encryption awareness not only complements traditional PhySec methods but also achieves superior secrecy performance. An encryption-aware secrecy capacity was also obtained from the rate-equivocation regions under different channel state information conditions.  more » « less
Award ID(s):
1956110
PAR ID:
10655660
Author(s) / Creator(s):
Publisher / Repository:
7th International Symposium on Signal Processing Systems
Date Published:
Subject(s) / Keyword(s):
Encryption Error-prone ciphertext Physical-layer security Rate-equivocation region Secrecy capacity Wireless networks
Format(s):
Medium: X
Location:
Ho Chi Minh City, Vietnam
Sponsoring Org:
National Science Foundation
More Like this
  1. We consider a secure integrated sensing and communication (ISAC) scenario, where a signal is transmitted through a state-dependent wiretap channel with one legitimate receiver with which the transmitter communicates and one honest-but-curious target that the transmitter wants to sense. The secure ISAC channel is modeled as two state-dependent fast-fading channels with correlated Rayleigh fading coefficients and independent additive Gaussian noise components. Delayed channel outputs are fed back to the transmitter to improve the communication performance and to estimate the channel state sequence. We establish and illustrate an achievable secrecy-distortion region for degraded secure ISAC channels under correlated Rayleigh fading, for which we show that the signal-to-interference-plus-noise is not a sufficient statistic. We also evaluate the inner bound for a large set of parameters to derive practical design insights. The presented results include parameter ranges for which the secrecy capacity of a classical wiretap channel setup is surpassed and for which the channel capacity is approached. Thus, we illustrate for correlated Rayleigh fading cases that our secure ISAC methods can (i) eliminate the need for the legitimate receiver to have a statistical advantage over the eavesdropper and (ii) provide communication security with minimal rate penalty. 
    more » « less
  2. In this paper, a joint source-channel coding approach is taken to the problem of securely computing a function of distributed sources over a multiple-access wiretap channel that is linear with respect to a finite field. It is shown that if the joint source distribution fulfills certain conditions and the function to be computed matches the linear structure of the channel, secrecy comes for free in the sense that the fundamental limit (i.e., the secrecy computation-capacity) is achieved without the need for stochastic encoding. Furthermore, the legitimate receiver does not need any advantage over the eavesdropper, which is in stark contrast to standard physical-layer security results. 
    more » « less
  3. We identify a novel method of using feedback to provide enhanced information-theoretical security in the presence of an eavesdropper. This method begins with a fixed linear coset code providing both secrecy and error detection/correction, as has been described by several authors. The legitimate receiver then sends the syndrome information for the received codeword, and based on this feedback, the transmitter can provide further error correction information specifically tailored to assist only the legitimate receiver. We show that this method allows secure communication with the legitimate receiver even when the eavesdropper’s channel is superior to that of the legitimate receiver. 
    more » « less
  4. null (Ed.)
    In this paper, we show that caching can aid in achieving secure communications by considering a wiretap scenario where the transmitter and legitimate receiver share access to a secure cache, and an eavesdropper is able to tap transmissions over a binary erasure wiretap channel during the delivery phase of a caching protocol. The scenario under consideration gives rise to a new channel model for wiretap coding that allows the transmitter to effectively choose a subset of bits to erase at the eavesdropper by caching the bits ahead of time. The eavesdropper observes the remainder of the coded bits through the wiretap channel for the general case. In the wiretap type-II scenario, the eavesdropper is able to choose a set of revealed bits only from the subset of bits not cached. We present a coding approach that allows efficient use of the cache to realize a caching gain in the network, and show how to use the cache to optimize the information theoretic security in the choice of a finite blocklength code and the choice of the cached bit set. To our knowledge, this is the first work on explicit algorithms for secrecy coding in any type of caching network. 
    more » « less
  5. This paper considers secure communication in the presence of an eavesdropper and a malicious jammer. The jammer is assumed to be oblivious of the communication signals emitted by the legitimate transmitter(s) but can employ any jamming strategy subject to a given power constraint and shares her jamming signal with the eavesdropper. Four such models are considered: (i) the Gaussian point-to-point wiretap channel; (ii) the Gaussian multiple-access wiretap channel; (iii) the Gaussian broadcast wiretap channel; and (iv) the Gaussian symmetric interference wiretap channel. The use of pre-shared randomness between the legitimate users is not allowed in our models. Inner and outer bounds are derived for these four models. For (i), the secrecy capacity is obtained. For (ii) and (iv) under a degraded setup, the optimal secrecy sum-rate is characterized. Finally, for (iii), ranges of model parameter values for which the inner and outer bounds coincide are identified. 
    more » « less