An official website of the United States government
We consider the problem of covert communication over a state-dependent channel, for which the transmitter and the legitimate receiver have non-causal access to the channel state information. Covert communication with respect to an adversary, referred to as the “warden,” is one in which the distribution induced during communication at the channel output observed by the warden is identical to the output distribution conditioned on an inactive channel-input symbol. Covert communication involves fooling an adversary in part by a proliferation of codebooks; for reliable decoding at the legitimate receiver the codebook uncertainty is removed via a shared secret key that is unavailable to the warden. Unlike earlier work in state-dependent covert communication, we do not assume the availability of a shared key at the transmitter and legitimate receiver. Rather, a shared randomness is extracted at the transmitter and the receiver from the channel state, in a manner that keeps the shared randomness secret from the warden despite the influence of the channel state on the warden’s output. An inner bound on the covert capacity, in the absence of an externally provided secret key, is derived.
more »
« less
This content will become publicly available on December 11, 2026
Analysis of Semantic Communication for Logic-based Hypothesis Deduction
This work presents an analysis of semantic com- munication in the context of First-Order Logic (FOL)-based deduction. Specifically, the receiver holds a set of hypotheses about the State of the World (SotW), while the transmitter has incomplete evidence about the true SotW but lacks access to the ground truth. The transmitter aims to communicate limited information to help the receiver identify the hypothesis most consistent with true SotW. We formulate the objective as approximating the posterior distribution of the transmitter at the receiver. Using Stirling’s approximation, this reduces to a constrained, finite-horizon resource allocation problem. Applying the Karush-Kuhn-Tucker conditions yields a truncated water- filling solution. Despite the problem’s non-convexity, symmetry and permutation invariance ensure global optimality. Based on this, we design message selection strategies, both for single- and multi- round communication, and model the receiver’s inference as an m-ary Bayesian hypothesis testing problem. Under the Maximum A Posteriori (MAP) rule, our communication strategy achieves optimal performance within budget constraints. We further analyze convergence rates and validate the theoretical findings through experiments, demonstrating reduced error over random selection and prior methods.
more »
« less
- Award ID(s):
- 2003002
- PAR ID:
- 10654885
- Publisher / Repository:
- IEEE Globecom
- Date Published:
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
As wireless devices hold prominent roles as means of communication, developing strong security methods against sophisticated cyber-attacks has become paramount. A novel physical layer based technique for securing wireless communication between the transmitter and receiver is described in this paper. The technique involves obfuscating the preamble data of the baseband signal through unique keys that are independently generated at both the transmitter and the receiver based on channel characteristics known only to the pair. The obfuscation technique is developed on the Drexel Software Defined Communication testbed on a Xilinx Virtex 6 ML605 board.more » « less
-
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
-
The propagation of acoustic waves under water is a highly complex and stochastic process. Such channel dynamics renders large performance variation in underwater acoustic (UWA) communications. Prediction of the UWA communication performance is critical for selection and adaptation of the communication strategies. This work explores the use of supervised learning for performance prediction in UWA communications. This work first quantifies the transmitter design, the UWA channel characteristics and the receiver design by numerical and categorical parameters. For a chosen performance metric (e.g., the bit error rate or the packet error rate), the performance prediction is cast individually into a numerical prediction problem and a classification problem. Using the data sets from two field experiments, the performance of typical supervised learning methods are examined. The data processing results reveal that some supervised learning methods can achieve fairly good numerical prediction or classification performance, and the discriminative models typically outperform the generative models.more » « less
-
Classical beamforming techniques rely on highly linear transmitters and receivers to allow phase-coherent combining at the transmitter and receiver. The transmitter uses eamforming to steer signal power towards the receiver, and the receiver uses beamforming to gather and coherently combine the signals from multiple receiver antennas. When the transmitters and receivers are instead constrained for power and cost reasons to be nonlinear one-bit devices, the potential advantages and performance metrics associated with beamforming are not as well understood. We define beamforming at the transmitter as a codebook design problem to maximize the minimum distance between codewords. We define beamforming at the receiver as the maximum likelihood detector of the transmitted codeword. We show that beamforming with one-bit transceivers is a constellation design problem, and that we can come within a few dB SNR of the capacity attained by linear transceivers.more » « less
