SearcharxivSearch

arXiv subjects

Denis Kozlov

Publications and source records attributed to Denis Kozlov.

3 recordsLinked to original sources

Secure Joint Source-Channel Coding of Multimodal Semantic Sources

We study the problem of secure joint source-channel coding for multimodal semantic sources transmitted over noisy wiretap channels. The source model consists of $m$ modalities (e.g., image, audio, and sensor data), all represented as random variables. The encoder observes independent and identically distributed samples of an arbitrary non-empty subset of modalities. The samples are encoded and transmitted over a discrete memoryless wiretap channel. The legitimate receiver reconstructs all modalities. We extend the rate-distortion-perception problem formulation to multimodal sources. We establish converse and achievability bounds on the fundamental limits of transmission rate, fidelity, and secrecy, under per-modality distortion and perception constraints, and per-subset equivocation constraints. We show that the fundamental limit for secrecy consists of three operationally distinct components: the level of compression, the secret key rate, and the statistics of the wiretap channel.

cs.IT

Secure Semantic Communication over Wiretap Channels: Rate-Distortion-Equivocation Tradeoff

This paper investigates an information-theoretic model of secure semantic-aware communication. For this purpose, we consider the lossy joint source-channel coding (JSCC) of a memoryless semantic source transmitted over a memoryless wiretap channel. The source consists of two correlated parts that represent semantic and observed aspects of the information. Our model assumes separate fidelity and secrecy constraints on each source component and, in addition, encompasses two cases for the source output, in order to evaluate the performance gains if the encoder has an extended access to the source. Specifically, in Case 1, the encoder has direct access only to the samples from a single (observed) source component, while in Case 2 it has additional direct access to the samples of the underlying semantic information. We derive single-letter converse and achievability bounds on the rate-distortion-equivocation region. The converse bound explicitly contains rate-distortion functions, making it easy to evaluate, especially for some common distributions. The proposed achievability coding scheme involves novel stochastic superposition coding with two private parts to enable analysis of the equivocation for each source component, separately. Our results generalise some of the previously established source and source-channel coding problems. The general results are further specialised to Gaussian and Bernoulli sources transmitted over Gaussian and binary wiretap channels, respectively. The numerical evaluations illustrate the derived bounds for these distributions.

cs.IT

Secure Semantic Communication over Wiretap Channel

Semantic communication is a new paradigm for information transmission that integrates the essential meaning (semantics) of the message into the communication process. However, like in classic wireless communications, the open nature of wireless channels poses security risks for semantic communications. In this paper, we characterize information-theoretic limits for the secure transmission of a semantic source over a wiretap channel. Under separate secrecy and distortion constrains for semantics and observed data, we present general inner and outer bounds on the rate-distortion-equivocation region. We also reduce the general region to the case of Gaussian source and Gaussian wiretap channel and provide numerical evaluations.

cs.IT