Can Coding Be Both Lossless and Private?

We show that one can simultaneously achieve strong secrecy and strong privacy, i.e., the conditional mutual information terms in (2) and (3), respectively, are negligible, by using a large private key K. The lossy secure and and private source coding region RD is characterized below; see Section V for its proof. We next take the liberty to use the lossy rate region in Corollary 1, characterized for discrete memoryless channels, for the model in (29)-(31)