Search papers, labs, and topics across Lattice.
This paper investigates the fundamental limits of secure rate-distortion-perception (RDP) when compressing data for perceptual quality while ensuring security over public channels. The authors characterize the exact secure RDP region for noiseless channels and derive inner and outer bounds for broadcast channels (BCs), demonstrating tightness for more-capable BCs. They further show the optimality of separate source-channel coding with common randomness and highlight the significant rate reduction achievable with common randomness in secure RDP, contrasting with standard rate-distortion scenarios.
Common randomness dramatically slashes communication rates in secure perceptual data compression, a stark contrast to its limited impact in standard compression scenarios.
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.
