Computer Science – Information Theory
Scientific paper
2011-05-26
Computer Science
Information Theory
56 pages, 5 figures, submitted to IEEE Transactions on Information Theory; corrected typos; updated references; clarified comp
Scientific paper
We 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, we consider resolvability-based constructions, which associate to each message a sub-code whose rate is beyond the resolvability of the eavesdropper's channel. We 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. Specifically, we show that, at least for binary symmetric wiretap channels, random capacity-based constructions fail to approach the strong secrecy capacity while resolvability-based constructions achieve it. We then obtain the secrecy-capacity region of arbitrary broadcast channels with confidential messages and a cost constraint for strong secrecy metrics, which generalizes existing results. Finally, we specialize our results to study the secrecy capacity of wireless channels with perfect channel state information, compound and mixed channels, as well as the secret-key capacity of source models for secret-key agreement. By tying secrecy to resolvability, we obtain achievable rates for stronger secrecy metrics and with simpler proofs than previously derived.
Bloch Matthieu R.
Laneman Nicholas J.
No associations
LandOfFree
Secrecy from Resolvability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Secrecy from Resolvability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secrecy from Resolvability will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-664154