Secrecy via sources and channels — A secret key - Secret message rate tradeoff region

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. No other resource, in particular, no other channel is available. We are interested in characterizing the fundamental trade-off between the rates of the secret message and secret key. We present an achievable solution based on a separation architecture and prove its optimality under three settings: when Eve's source and channel are degraded versions of Bob's, and either Bob's source or channel is by itself useless in generating a secret key.

[1]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[2]  V. Prabhakaran A Separation Result for Secure Communication , 2007 .

[3]  U. Maurer,et al.  Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.

[4]  Imre Csiszár,et al.  Common randomness and secret key generation with a helper , 2000, IEEE Trans. Inf. Theory.

[5]  Suhas N. Diggavi,et al.  Secret-key generation with correlated sources and noisy channels , 2008, 2008 IEEE International Symposium on Information Theory.

[6]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[7]  Rudolf Ahlswede,et al.  Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.

[8]  A. Sridharan Broadcast Channels , 2022 .