Coding Schemes for Achieving Strong Secrecy at Negligible Cost

Understand

We study the problem of achieving strong secrecy over wiretap channels at negligible cost, in the sense of maintaining the overall communication rate of the same channel without secrecy constraints.

• Specifically, we propose and analyze two source-channel coding architectures, in which secrecy is achieved by multiplexing public and confidential messages.
• In both cases, our main contribution is to show that secrecy can be achieved without compromising communication rate and by requiring only randomness of asymptotically vanishing rate.
• Our first source-channel coding architecture relies on a modified wiretap channel code, in which randomization is performed using the output of a source code.