Research indexJournal article
Security embedding codes
Ly, Liu, Blankenship
1 Jun 2010
NobleIDark:/48914/w1/20260521/8FEB7755DOI10.1109/isit.2010.5513548
Security embedding codes
Ly, Liu, Blankenship · 2010 · Subscription
NobleIDark:/48914/w1/20260521/8FEB7755DOI10.1109/isit.2010.5513548
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
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.