Table of Contents
Fetching ...

Low-latency Secure Integrated Sensing and Communication with Transmitter Actions

Truman Welling, Onur Günlü, Aylin Yener

TL;DR

An information theoretic model of secure integrated sensing and communication, represented as a wiretap channel with action dependent states, is considered, giving an achievable bound for low-latency applications.

Abstract

This paper considers an information theoretic model of secure integrated sensing and communication, represented as a wiretap channel with action dependent states. This model allows securing part of a transmitted message against a sensed target that eavesdrops the communication, while enabling transmitter actions to change the channel statistics. An exact secrecy-distortion region is given for a physically-degraded channel. A finite-length achievability region is established for the model using an output statistics of random binning method, giving an achievable bound for low-latency applications.

Low-latency Secure Integrated Sensing and Communication with Transmitter Actions

TL;DR

An information theoretic model of secure integrated sensing and communication, represented as a wiretap channel with action dependent states, is considered, giving an achievable bound for low-latency applications.

Abstract

This paper considers an information theoretic model of secure integrated sensing and communication, represented as a wiretap channel with action dependent states. This model allows securing part of a transmitted message against a sensed target that eavesdrops the communication, while enabling transmitter actions to change the channel statistics. An exact secrecy-distortion region is given for a physically-degraded channel. A finite-length achievability region is established for the model using an output statistics of random binning method, giving an achievable bound for low-latency applications.
Paper Structure (5 sections, 2 theorems, 35 equations, 1 figure)

This paper contains 5 sections, 2 theorems, 35 equations, 1 figure.

Key Result

Theorem 1

(Physically-degraded): For a physically-degraded ISAC channel, $\mathcal{R}_{\textnormal{PS,Act}}$ is the union over all joint distributions $P_{VAX}$ of the rate tuples $(R_{1}, R_{2},D_1,D_2)$ satisfying where we have and one can use the deterministic per-letter estimators $\mathsf{Est}_j(a,x,y_1,y_2)=~\widehat{s}_j$ for $j=1,2$ such that One can also bound $|\mathcal{V}|$ by

Figures (1)

  • Figure 1: Secure ISAC model with transmitter action-dependent states under partial secrecy, where we have $M=(M_1,M_2)$ and only $M_2$ should be kept secret from Eve, for $i~=~[1:n]$. The channel input $X_i$ is a function of $(M,A_i)$.

Theorems & Definitions (5)

  • Definition 1
  • Definition 2
  • Theorem 1
  • Definition 3
  • Theorem 2