Secrecy From Resolvability
Source: University of Notre Dame
The authors investigate an approach to physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is fundamentally tied to the notion of resolvability. Instead of considering capacity-based constructions, which associate to each message a sub-code whose rate approaches the capacity of the eavesdropper's channel, they consider resolvability-based constructions, which associate to each message a sub-code whose rate is beyond the resolvability of the eavesdropper's channel. They provide evidence that resolvability is a more powerful and perhaps more fundamental coding mechanism for secrecy by developing results that hold for strong secrecy metrics and arbitrary channels.