Secrecy via Sources and Channels
From MaRDI portal
Abstract: Alice and Bob want to share a secret key and to communicate an independent message, both of which they desire to be kept secret from an eavesdropper Eve. We study this problem of secret communication and secret key generation when two resources are available -- correlated sources at Alice, Bob, and Eve, and a noisy broadcast channel from Alice to Bob and Eve which is independent of the sources. We are interested in characterizing the fundamental trade-off between the rates of the secret message and secret key. We present an achievable solution and prove its optimality for the parallel channels and sources case when each sub-channel and source component satisfies a degradation order (either in favor of the legitimate receiver or the eavesdropper). This includes the case of jointly Gaussian sources and an additive Gaussian channel, for which the secrecy region is evaluated.
Recommendations
- Secrecy for security protocols
- scientific article; zbMATH DE number 2038768
- Communication Theory of Secrecy Systems*
- Theory of Cryptography
- scientific article; zbMATH DE number 1497862
- Secure Pseudonymous Channels
- Preserving Secrecy Under Refinement
- Strong Secrecy From Channel Resolvability
- Secrecy without one-way functions
- scientific article; zbMATH DE number 1693541
Cited in
(4)
This page was built for publication: Secrecy via Sources and Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989694)
