Security embedding codes

This paper considers the problem of simultaneously communicating high-security and low-security messages, referred to as the security embedding problem. An information-theoretic model is presented. A coding scheme that combines superposition coding and random binning is proposed and is shown to achieve the capacity region in several communication scenarios. As an application, it is shown that a simple scheme that combines security embedding codes and secure network coding can achieve the secrecy capacity of a parallel multi-eavesdropper wiretap channel with two reversely degraded components.