On the Secrecy Rate of Artificial Noise Assisted MIMOME Channels with Full-Duplex Receiver
Sangseok Yun, Junguk Park, Sanghun Im, Jeongseok Ha
Abstract
Sangseok Yun, Junguk Park, Sanghun Im, Jeongseok Ha
Abstract
This paper studies a secure communication over multiple-input multiple-output multi-antenna eavesdropper (MIMOME) channels which consist of legitimate parities, namely a transmitter and receiver, equipped with multi-antennas and a passive eavesdropper with multi-antennas. For securing the communication between the legitimate parties, we consider an artificial noise (AN) scheme in which the legitimate transmitter sends its secret messages and AN signal together. Meanwhile, it is assumed that the legitimate receiver has a full-duplex capability which enables it to capture the secret message from the transmitter and simultaneously generate a jamming signal to strengthen security. While there have been studies on similar setups, most of them focus on the design of the jamming signal with the assumption of full channel-state information (CSI) and/or system parameter optimization based on numerical evaluations. On the contrary, in this work, we instead introduce a tight lower bound on an achievable ergodic secrecy rate as a versatile analytic tool and derive a closed-form expressions for the bound. To confirm the analytic results, we carry out numerical evaluations of the ergodic secrecy rate which are compared with the proposed lower bound.
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper studies a secure communication over multiple-input multiple-output multi-antenna eavesdropper (MIMOME) channels which consist of legitimate parities, namely a transmitter and receiver, equipped with multi-antennas and a passive eavesdropper with multi-antennas. For securing the communication between the legitimate parties, we consider an artificial noise (AN) scheme in which the legitimate transmitter sends its secret messages and AN signal together. Meanwhile, it is assumed that the legitimate receiver has a full-duplex capability which enables it to capture the secret message from the transmitter and simultaneously generate a jamming signal to strengthen security. While there have been studies on similar setups, most of them focus on the design of the jamming signal with the assumption of full channel-state information (CSI) and/or system parameter optimization based on numerical evaluations. On the contrary, in this work, we instead introduce a tight lower bound on an achievable ergodic secrecy rate as a versatile analytic tool and derive a closed-form expressions for the bound. To confirm the analytic results, we carry out numerical evaluations of the ergodic secrecy rate which are compared with the proposed lower bound.
Key concepts: Jamming, Transmitter, Artificial noise, Secrecy, Computer science, Ergodic theory, Upper and lower bounds, Secure communication