Secrecy via Sources and Channels

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. 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 is studied. The goal is to characterize the fundamental tradeoff between the rates of the secret message and secret key. An achievable solution and proof of its optimality for the parallel channels and sources case when each subchannel and source component satisfies a degradation order (either in favor of the legitimate receiver or the eavesdropper) is presented. This includes the case of jointly Gaussian sources and an additive Gaussian channel, for which the secrecy region is evaluated.

[1]  L. Goddard.  Information Theory , 1962, Nature.

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

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

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

[5]  Ueli Maurer,et al.  Generalized privacy amplification , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

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

[7]  Ueli Maurer,et al.  Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free , 2000, EUROCRYPT.

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

[9]  Bin Dai,et al.  Wiretap Channel With Side Information , 2006, ArXiv.

[10]  A. Vinck,et al.  An Achievable Region of Gaussian Wiretap Channel with Side Information , 2007, 2007 IEEE International Symposium on Information Theory.

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

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

[13]  K. Ramchandran,et al.  Secret communication using sources and channels , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[14]  Jin Xu,et al.  Broadcast confidential and public messages , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[15]  Moustafa Youssef,et al.  On the delay limited secrecy capacity of fading channels , 2009, 2009 IEEE International Symposium on Information Theory.

[16]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[17]  Suhas N. Diggavi,et al.  Secret-Key Agreement With Channel State Information at the Transmitter , 2010, IEEE Transactions on Information Forensics and Security.

[18]  Suhas N. Diggavi,et al.  Secret-Key Generation Using Correlated Sources and Channels , 2009, IEEE Transactions on Information Theory.

[19]  A. Sridharan.  Broadcast Channels , 2022 .