On Scalable Source Coding Problem with Side Information Privacy

The rate-distortion-equivocation region has been derived recently for the Heegard-Berger problem, in which only one of the decoders has access to the correlated side information, under the constraint of the side information privacy which is desired to keep the side information private from the uninformed decoder. In this paper, this result is extended to two special cases of the scalable source coding problem, in which the encoder sends a two-layer description to two decoders such that the first layer can be received by both two decoders, while the second is only for one of two decoders. For the first case when the second-layer description is only available at the informed decoder, the set of all feasible rate-distortion-equivocation is characterized under the constraint of the side information privacy. For the other case when the second-layer description is only at the uninformed decoder, the inner bound and the outer bound of the rate-distortion-equivocation region are provided under the constraint of the side information privacy.