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

  title={Secret-Key Agreement With Public Discussion Subject to an Amplitude Constraint},
  author={Marwen Zorgui and Zouheir Rezki and Basel Alomair and Mohamed-Slim Alouini},
  journal={IEEE Communications Letters},
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… Expand
Secret-key agreement with public discussion over multi-antenna transmitters with amplitude constraints
It is proved that the capacity is achieved by a discrete input, i.e., an input whose support is sparse, and hence the Karush-Kuhn-Tucker (KKT) condition provides a necessary and sufficient condition for optimality. Expand
Mobility-based Physical-layer Key Generation Scheme for D2D Communications Underlaying Cellular Network
A mobility-based physical-layer key generation scheme and use Gaussian random vector for key extraction and analysis is proposed and the relative results confirm the theoretical derivation and the advantages of the scheme. Expand
Plaintext recovery attack on 3DES algorithm with different byte keys
  • J. Gong
  • Computer Science
  • J. Intell. Fuzzy Syst.
  • 2020


Noncoherent Capacity of Secret-Key Agreement With Public Discussion
We study the noncoherent capacity of secret-key agreement with public discussion over independent identically distributed (i.i.d.) Rayleigh fading wireless channels, where neither the sender nor theExpand
Gaussian Wiretap Channel With Amplitude and Variance Constraints
It is shown that under sufficiently small amplitude constraints the possible tradeoff between the secrecy capacity and the capacity does not exist and they are both achieved by the symmetric binary distribution, and the optimality of discrete input distributions in the presence of an additional variance constraint is proved. Expand
Secret key agreement by public discussion from common information
  • U. Maurer
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1993
It is shown that such a secret key agreement is possible for a scenario in which all three parties receive the output of a binary symmetric source over independent binary asymmetric channels, even when the enemy's channel is superior to the other two channels. Expand
On the capacity-achieving distribution of the discrete-time noncoherent and partially coherent AWGN channels
  • M. Katz, S. Shamai
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 2004
The communication limits over rapid phase-varying channels are investigated and the capacity of a discrete- time noncoherent additive white Gaussian noise (NCAWGN) channel under the average power constraint is considered. Expand
Physical-Layer Security for MISO Visible Light Communication Channels
This paper describes secrecy rates achievable via transmit beamforming over the multiple-input, single-output (MISO) VLC wiretap channel, and proposes a robust beamforming scheme to consider the scenario wherein information about the eavesdropper's channel is imperfect due to location uncertainty. Expand
The noncoherent rician fading Channel-part I: structure of the capacity-achieving input
It is proven that the optimal input amplitude distribution has bounded support over the entire signal-to-noise ratio (SNR) range when there is only a peak-power constraint. Expand
Secret Sharing over Fast-Fading MIMO Wiretap Channels
The effects of spatial dimensionality provided by the use of multiple antennas at the source, destination, and eavesdropper are investigated and the key capacity of the fast-fading MIMO wiretap channel is evaluated. Expand
Common randomness in information theory and cryptography - I: Secret sharing
As the first part of a study of problems involving common randomness at distance locations, information-theoretic models of secret sharing (generating a common random key at two terminals, withoutExpand
Channel capacity and non-uniform signalling for free-space optical intensity channels
A significant gain in both rate and probability of outage is achieved compared to uniform signalling, especially in the case of channels corrupted by fog, as well as a practical algorithm for non-uniform optical intensity signalling. Expand
Capacity-achieving probability measure for conditionally Gaussian channels with bounded inputs
This work study the capacity-achieving probability measure for conditionally Gaussian channels subject to bounded-input constraints and average cost constraints, and shows that the channel capacity is achievable and the measure is proved to be discrete. Expand