Generalized Secure Distributed Source Coding with Side Information

TL;DR

This paper establishes new bounds on the limits of secure distributed source coding with side information, addressing the trade-offs between compression efficiency and data secrecy in multi-user channels.

Contribution

It introduces novel inner and outer bounds for the achievable rate region in secure distributed source coding with side information, extending and generalizing previous results.

Findings

Derived new bounds that do not generally match, indicating potential for tighter characterizations.

Identified special cases where bounds coincide, providing exact rate regions.

Unified previous results within the proposed generalized framework.

Abstract

In this paper, new inner and outer bounds on the achievable compression-equivocation rate region for generalized secure data compression with side information are given that do not match in general. In this setup, two senders, Alice and Charlie intend to transmit information to Bob via channels with limited capacity so that he can reliably reconstruct their observations. The eavesdropper, Eve, has access to one of the channels at each instant and is interested in the source of the same channel at the time. Bob and Eve also have their own observations which are correlated with Alice's and Charlie's observations. In this model, two equivocation and compression rates are defined with respect to the sources of Alice and Charlie. Furthermore, different special cases are discussed where the inner and outer bounds match. Our model covers the previously obtained results as well.