Secure Lossy Source Coding for Some Classes of Helper and Gray-Wyner Models

In this work, we investigate two source coding models, a Helper problem and a Gray-Wyner problem, under equivocation constraints. Specifically, in the Helper problem, an encoder communicates with a legitimate receiver through a noise-free rate-limited public link as well as a noise-free rate-limited private link; and an external passive eavesdropper intercepts every information that is sent on the public link. We study two classes of this model: i) when a pair of arbitrarily correlated discrete memoryless sources is to be encoded such that one component has to be recovered lossily at the legitimate receiver while the equivocation about both components at the eavesdropper must be maintained no smaller than some prescribed level; and ii) when the legitimate receiver reproduces both components, one of which, that is recovered losslessly, has to be concealed from the eavesdropper to some equivocation level. For both classes of Helper problems, we establish single-letter characterizations of optimal ratedistortion-equivocation tradeoffs in the discrete memoryless case. Next, we extend our results to the case of two legitimate receivers, i.e., Gray-Wyner type network model with equivocation constraints. Here, two legitimate receivers are connected to the encoder each through a dedicated error-free private link as well as a common error-free public link; and an external passive eavesdropper overhears on the public link. We study two classes of this model that are extensions of the aforementioned instances of Helper problems to the case of two receivers. For each of the two classes, we establish a single-letter characterization of the optimal rate-distortion-equivocation region. Throughout the paper, the analysis sheds light on the role of the private links, and we illustrate the results by computing them for some binary examples. Also, we make some meaningful connections, e.g., with problems of secret-sharing and encryption.