Secret-Key Agreement with Public Discussion subject to an Amplitude Constraint

Marwen Zorgui, Zouheir Rezki, Basel Alomair, Mohamed-Slim Alouini

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


This paper 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.
Original languageEnglish (US)
Pages (from-to)1124-1127
Number of pages4
JournalIEEE Communications Letters
Issue number6
StatePublished - Apr 6 2016

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01


Dive into the research topics of 'Secret-Key Agreement with Public Discussion subject to an Amplitude Constraint'. Together they form a unique fingerprint.

Cite this