Secret-Key Agreement With Public Discussion Subject to an Amplitude Constraint

This letter considers the problem of secret-key agreement with public discussion subject to a peak power constraint A on the channel input. The optimal input distribution is proved to be discrete with finite support. To overcome the computationally heavy search for the optimal discrete distribution, several suboptimal schemes are proposed and shown numerically to perform close to the capacity. Moreover, lower and upper bounds for the secret-key capacity are provided and used to prove that the secret-key capacity converges for asymptotic high values of A, to the secret-key capacity with an average power constraint A2. Finally, when the amplitude constraint A is small (A → 0), the secret-key capacity is proved to be asymptotically equal to the capacity of the legitimate user with an amplitude constraint A and no secrecy constraint.

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

[2]  Lutz H.-J. Lampe,et al.  Physical-Layer Security for MISO Visible Light Communication Channels , 2015, IEEE Journal on Selected Areas in Communications.

[3]  Shlomo Shamai,et al.  The capacity of average and peak-power-limited quadrature Gaussian channels , 1995, IEEE Trans. Inf. Theory.

[4]  Mohamed-Slim Alouini,et al.  Noncoherent Capacity of Secret-Key Agreement With Public Discussion , 2011, IEEE Transactions on Information Forensics and Security.

[5]  Steve Hranilovic,et al.  Channel capacity and non-uniform signalling for free-space optical intensity channels , 2009, IEEE Journal on Selected Areas in Communications.

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

[7]  Mohamed-Slim Alouini,et al.  On the Capacity of the Intensity-Modulation Direct-Detection Optical Broadcast Channel , 2016, IEEE Transactions on Wireless Communications.

[8]  Amos Lapidoth,et al.  On the Capacity of Free-Space Optical Intensity Channels , 2008, IEEE Transactions on Information Theory.

[9]  Shlomo Shamai,et al.  On the capacity-achieving distribution of the discrete-time noncoherent and partially coherent AWGN channels , 2004, IEEE Transactions on Information Theory.

[10]  Aslan Tchamkerten,et al.  On the discreteness of capacity-achieving distributions , 2004, IEEE Transactions on Information Theory.

[11]  H. Vincent Poor,et al.  The noncoherent rician fading Channel-part I: structure of the capacity-achieving input , 2005, IEEE Transactions on Wireless Communications.

[12]  Matthieu Bloch,et al.  Secret Sharing over Fast-Fading MIMO Wiretap Channels , 2009, EURASIP J. Wirel. Commun. Netw..

[13]  Huan Zhang,et al.  Performance Analysis of Physical Layer Security Over Generalized-$K$ Fading Channels Using a Mixture Gamma Distribution , 2016, IEEE Communications Letters.

[14]  Joel G. Smith,et al.  The Information Capacity of Amplitude- and Variance-Constrained Scalar Gaussian Channels , 1971, Inf. Control..

[15]  Jonathan M. Nichols,et al.  Calculation of Differential Entropy for a Mixed Gaussian Distribution , 2008, Entropy.

[16]  Frank R. Kschischang,et al.  Capacity-achieving probability measure for conditionally Gaussian channels with bounded inputs , 2005, IEEE Transactions on Information Theory.

[17]  Sennur Ulukus,et al.  Gaussian Wiretap Channel With Amplitude and Variance Constraints , 2015, IEEE Transactions on Information Theory.