Secure Rate-Distortion-Perception: A Randomized Distributed Function Computation Approach for Realism

• URL: http://arxiv.org/abs/2604.20245v1
• Date: Wed, 22 Apr 2026 06:47:59 GMT
• Title: Secure Rate-Distortion-Perception: A Randomized Distributed Function Computation Approach for Realism
• Abstract summary: When compressed data is transmitted over public communication channels, security risks emerge.<n>We study secure under negligible information leakage over both noiseless channels and broadcast channels.<n>Our results illustrate that random binning-based coding achieves strong secrecy, low distortion, and high perceptual quality simultaneously.
• Score: 6.141945506223323
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Fundamental rate-distortion-perception (RDP) trade-offs arise in applications requiring maintained perceptual quality of reconstructed data, such as neural image compression. When compressed data is transmitted over public communication channels, security risks emerge. We therefore study secure RDP under negligible information leakage over both noiseless channels and broadcast channels, BCs, with correlated noise components. For noiseless channels, the exact secure RDP region is characterized. For BCs, an inner bound is derived and shown to be tight for a class of more-capable BCs. Separate source-channel coding is further shown to be optimal for this exact secure RDP region with unlimited common randomness available. Moreover, when both encoder and decoder have access to side information correlated with the source and the channel is noiseless, the exact RDP region is established. If only the decoder has correlated side information in the noiseless setting, an inner bound is derived along with a special case where the region is exact. Binary and Gaussian examples demonstrate that common randomness can significantly reduce the communication rate in secure RDP settings, unlike in standard rate-distortion settings. Thus, our results illustrate that random binning-based coding achieves strong secrecy, low distortion, and high perceptual quality simultaneously.

Related papers

• Rateless DeepJSCC for Broadcast Channels: a Rate-Distortion-Complexity Tradeoff [29.652183083806776]
  This paper introduces nonlinear transform rateless source-channel coding (NTR SCC) for broadcast channels based on rateless codes.<n>We develop unequal protection schemes that exploit decoder side information, and devise approximations to enable end-to-end optimization of rateless parameters.<n>Our framework enables heterogeneous receivers to adaptively adjust their received number of rateless symbols and decoding iterations in belief propagation.
  arXiv  Detail & Related papers  (2026-03-23T06:25:39Z)
• Randomized Distributed Function Computation (RDFC): Ultra-Efficient Semantic Communication Applications to Privacy [7.255894982283692]
  We establish the randomized distributed function computation (RDFC) framework, in which a sender transmits just enough information for a receiver to generate a randomized function of the input data.<n>We show that security and privacy constraints naturally fit this model, as they generally require a randomization step.<n>Our results position RDFC as an energy-efficient semantic communication strategy for privacy-aware distributed computation systems.
  arXiv  Detail & Related papers  (2026-03-10T12:23:50Z)
• Joint Source-Channel-Generation Coding: From Distortion-oriented Reconstruction to Semantic-consistent Generation [58.67925548779465]
  We propose Joint Source-Channel-Generation Coding (JSCGC), a novel paradigm that shifts the focus from perceptual reconstruction to probabilistic generation.<n>JSCGC improves substantially semantic quality and semantic fidelity, significantly outperforming conventional distortion-oriented J SCC methods.
  arXiv  Detail & Related papers  (2026-01-19T08:12:47Z)
• In-Context Source and Channel Coding [12.557918082908545]
  This paper proposes a receiver-side In-Context Decoding (ICD) framework that enhances SSCC robustness without modifying the transmitter.<n>ICD constructs a confidence-ranked candidate pool via reliability-guided bit flipping, samples a compact yet diverse subset of candidates, and applies an LLM-based arithmetic decoder to obtain both reconstructions and sequence-level log-likelihoods.
  arXiv  Detail & Related papers  (2026-01-15T10:37:57Z)
• SING: Semantic Image Communications using Null-Space and INN-Guided Diffusion Models [52.40011613324083]
  Joint source-channel coding systems (DeepJSCC) have recently demonstrated remarkable performance in wireless image transmission.<n>Existing methods focus on minimizing distortion between the transmitted image and the reconstructed version at the receiver, often overlooking perceptual quality.<n>We propose SING, a novel framework that formulates the recovery of high-quality images from corrupted reconstructions as an inverse problem.
  arXiv  Detail & Related papers  (2025-03-16T12:32:11Z)
• Task and Perception-aware Distributed Source Coding for Correlated Speech under Bandwidth-constrained Channels [3.674863913115431]
  AR/VR applications require real-time transmission of correlated high-fidelity speech from multiple resource-constrained devices over unreliable, bandwidth-limited channels.<n>Existing autoencoder-based speech source coding methods fail to address the combination of the following.<n>We propose a neural distributed principal component analysis (NDPCA)-aided distributed source coding algorithm for correlated speech sources transmitting to a central receiver.
  arXiv  Detail & Related papers  (2025-01-20T04:57:29Z)
• Rate-Distortion-Perception Tradeoff Based on the Conditional-Distribution Perception Measure [30.285592443654565]
  This paper studies the rate-distortion-perception tradeoff for a memoryless source model in the limit of large block-lengths.<n>We derive a single-letter characterization of the function for the case of discrete memoryless sources and show that the decoder can be restricted to a noise-adding mechanism.
  arXiv  Detail & Related papers  (2024-01-22T18:49:56Z)
• Distributed Deep Joint Source-Channel Coding with Decoder-Only Side Information [6.411633100057159]
  We consider low-latency image transmission over a noisy wireless channel when correlated side information is present only at the receiver side. We propose a novel neural network architecture that incorporates the decoder-only side information at multiple stages at the receiver side.
  arXiv  Detail & Related papers  (2023-10-06T15:17:45Z)
• Uncertainty-Aware Source-Free Adaptive Image Super-Resolution with Wavelet Augmentation Transformer [60.31021888394358]
  Unsupervised Domain Adaptation (UDA) can effectively address domain gap issues in real-world image Super-Resolution (SR) We propose a SOurce-free Domain Adaptation framework for image SR (SODA-SR) to address this issue, i.e., adapt a source-trained model to a target domain with only unlabeled target data.
  arXiv  Detail & Related papers  (2023-03-31T03:14:44Z)
• Deep Reinforcement Learning for IRS Phase Shift Design in Spatiotemporally Correlated Environments [93.30657979626858]
  We propose a deep actor-critic algorithm that accounts for channel correlations and destination motion. We show that, when channels aretemporally correlated, the inclusion of the SNR in the state representation with function approximation in ways that inhibit convergence.
  arXiv  Detail & Related papers  (2022-11-02T22:07:36Z)
• Disentangled Representation Learning for RF Fingerprint Extraction under Unknown Channel Statistics [77.13542705329328]
  We propose a framework of disentangled representation learning(DRL) that first learns to factor the input signals into a device-relevant component and a device-irrelevant component via adversarial learning. The implicit data augmentation in the proposed framework imposes a regularization on the RFF extractor to avoid the possible overfitting of device-irrelevant channel statistics. Experiments validate that the proposed approach, referred to as DR-RFF, outperforms conventional methods in terms of generalizability to unknown complicated propagation environments.
  arXiv  Detail & Related papers  (2022-08-04T15:46:48Z)
• Secure and Private Source Coding with Private Key and Decoder Side Information [139.515333493829]
  The problem of secure source coding with multiple terminals is extended by considering a remote source whose noisy measurements are correlated random variables. The main additions to the problem include 1) all terminals noncausally observe a noisy measurement of the remote source; 2) a private key is available to all legitimate terminals; 3) the public communication link between the encoder and decoder is rate-limited; 4) the secrecy leakage to the eavesdropper is measured with respect to the encoder input, whereas the privacy leakage is measured with respect to the remote source.
  arXiv  Detail & Related papers  (2022-05-10T17:51:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.