Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

European Conference on Antennas and Propagation

Optimal array signaling for key establishment in static multipath channels

Rashid Mehmood, Jon W. Wallace, Michael A. Jensen

Published May 13, 2015• 2 citations
OpenAlex

Abstract

This paper explores optimal array beamforming for secure communication in static multipath propagation environments. The problem is cast as a convex optimization of the average secure key rate achieved in the presence of a passive eavesdropper, and the optimization is performed using semidefinite programming. While representative results are presented for a uniform linear array, the optimization procedure can be generalized to any array topology.

Related papers

Secure array synthesis for encryption key establishment in multipath channels

Rashid Mehmood, Jon W. Wallace, Michael A. Jensen

This paper explores optimal array beamforming for establishing secret encryption keys through bidirectional channel estimation in multipath propagation environments. The problem is cast as a convex optimization of the average secure key rate achieved in the presence of a passive eavesdropper, and the optimization is performed using semi-definite programming. Representative results demonstrate that, compared to a conventional but suboptimal beamforming solution, the optimal solution achieves significantly higher key establishment performance, with the relative performance improvement increasing with the transmit correlation.

European Conference on Antennas and Propagation•Apr 1, 2016•1 citation

Secure Array Synthesis in Multipath Channels

Rashid Mehmood, Jon W. Wallace, Michael A. Jensen

While conventional antenna array synthesis determines the beamforming weights that create a specified antenna radiation pattern, secure array synthesis formulates the beamforming weights that enhance security for wireless transmission of sensitive data. This paper focuses on creating beamformers that improve the generation of secret encryption keys based on bidirectional estimation of the reciprocal electromagnetic propagation channel between two radios. The technique uses semidefinite programming to determine the array weights that maximize the average secure key rate under a constraint on the total transmit power. The numerical implementation of the technique incorporates array mutual coupling, and the results demonstrate that the technique outperforms a conventional beamforming solution, with the improvement becoming significant for certain channel correlation conditions.

IEEE Transactions on Antennas and Propagation•Apr 24, 2018•1 citation

A Robust Beamforming Approach to Guarantee Instantaneous Secrecy Rate

Jinho Choi

We consider a well-known beamforming approach that induces jamming signals to avoid eavesdropping from a transmitter equipped with an antenna array in this paper. With this beamforming, which is called masked beamforming, in order to guarantee a certain instantaneous secrecy rate, we formulate robust beamforming problems with a constraint that deals with the eavesdropper channel's uncertainty and find the solutions. Unlike a guaranteed ergodic secrecy rate, this guaranteed instantaneous secrecy rate allows us to use codes of short codewords for secure communications with masked beamforming over slow-fading channels. In addition, since the optimal solutions are found in closed form, we do not need to resort to any convex optimization solvers.

IEEE Transactions on Wireless Communications•Sep 25, 2015•11 citations

Robust Secure Transmit Design with Artificial Noise in the Presence of Multiple Eavesdroppers

Xiaochen Liu, Yuanyuan Gao, Nan Sha +2 more

This paper studies secure wireless transmission from a multi-antenna transmitter to a single-antenna intended receiver overheard by multiple eavesdroppers with considering the imperfect channel state information (CSI) of wiretap channel.To enhance security of communication link, the artificial noise (AN) is generated at transmitter.We first design the robust joint optimal beamforming of secret signal and AN to minimize transmit power with constraints of security quality of service (QoS), i.e., minimum allowable signal-to-interference-and-noise ratio (SINR) at receiver and maximum tolerable SINR at eavesdroppers.The formulated design problem is shown to be nonconvex and we transfer it into linear matrix inequalities (LMIs).The semidefinite relaxation (SDR) technique is used and the approximated method is proved to solve the original problem exactly.To verify the robustness and tightness of proposed beamforming, we also provide a method to calculate the worst-case SINR at eavesdroppers for a designed transmit scheme using semidefinite programming (SDP).Additionally, the secrecy rate maximization is explored for fixed total transmit power.To tackle the nonconvexity of original formulation, we develop an iterative approach employing sequential parametric convex approximation (SPCA).The simulation results illustrate that the proposed robust transmit schemes can effectively improve the transmit performance.

KSII Transactions on Internet and Information Systems•Jun 30, 2021•0 citations

Optimal array patterns for encryption key establishment in LOS channels

Rashid Mehmood, Jon W. Wallace, Michael A. Jensen

While the establishment of secret encryption keys based on reciprocal electromagnetic propagation has received recent attention, very limited work has appeared regarding how multiantenna radios should conduct the required channel estimation in the presence of an eavesdropper. This paper demonstrates array beamforming that maximizes the number of bits that can be established when an eavesdropper observes the channel estimation process.

Digest - IEEE Antennas and Propagation Society. International Symposium•Jul 1, 2014•3 citations

Co-Ordinated Secure Beamforming in -User Interference Channel With Multiple Eavesdroppers

Tiejun Lv, Hui Gao, Ruohan Cao +1 more

In this letter, we consider secrecy communications over multiple-input single-output K-user interference channel in the presence of multiple eavesdroppers. Each legitimate data link is wiretapped by several eavesdroppers. To keep the eavesdroppers ignorant of the confidential messages, we propose a co-ordinated secure beamforming scheme for maximizing the secrecy sum-rate subject to the individual power constraint of each transmitter. To solve the resultant nonconvex problem, we approximate it into a few semidefinite programs (SDPs) by employing the semidefinite relaxation (SDR) technique and a conservative convex approximation. It is demonstrated experimentally that the proposed algorithm converges within a few iterations. Furthermore, we prove that the SDP problem obtained via SDR always yields a rank-one solution such that the SDR is tight. Simulations show the efficacy of the proposed scheme.

IEEE Wireless Communications Letters•Jan 20, 2016•17 citations
This paper explores optimal array beamforming for secure communication in static multipath propagation environments. The problem is cast as a convex optimization of the average secure key rate achieved in the presence of a passive eavesdropper, and the optimization is performed using semidefinite programming. While representative results are presented for a uniform linear array, the optimization procedure can be generalized to any array topology.
This paper explores optimal array beamforming for establishing secret encryption keys through bidirectional channel estimation in multipath propagation environments. The problem is cast as a convex optimization of the average secure key rate achieved in the presence of a passive eavesdropper, and the optimization is performed using semi-definite programming. Representative results demonstrate that, compared to a conventional but suboptimal beamforming solution, the optimal solution achieves significantly higher key establishment performance, with the relative performance improvement increasing with the transmit correlation.
While conventional antenna array synthesis determines the beamforming weights that create a specified antenna radiation pattern, secure array synthesis formulates the beamforming weights that enhance security for wireless transmission of sensitive data. This paper focuses on creating beamformers that improve the generation of secret encryption keys based on bidirectional estimation of the reciprocal electromagnetic propagation channel between two radios. The technique uses semidefinite programming to determine the array weights that maximize the average secure key rate under a constraint on the total transmit power. The numerical implementation of the technique incorporates array mutual coupling, and the results demonstrate that the technique outperforms a conventional beamforming solution, with the improvement becoming significant for certain channel correlation conditions.
We consider a well-known beamforming approach that induces jamming signals to avoid eavesdropping from a transmitter equipped with an antenna array in this paper. With this beamforming, which is called masked beamforming, in order to guarantee a certain instantaneous secrecy rate, we formulate robust beamforming problems with a constraint that deals with the eavesdropper channel's uncertainty and find the solutions. Unlike a guaranteed ergodic secrecy rate, this guaranteed instantaneous secrecy rate allows us to use codes of short codewords for secure communications with masked beamforming over slow-fading channels. In addition, since the optimal solutions are found in closed form, we do not need to resort to any convex optimization solvers.
This paper studies secure wireless transmission from a multi-antenna transmitter to a single-antenna intended receiver overheard by multiple eavesdroppers with considering the imperfect channel state information (CSI) of wiretap channel.To enhance security of communication link, the artificial noise (AN) is generated at transmitter.We first design the robust joint optimal beamforming of secret signal and AN to minimize transmit power with constraints of security quality of service (QoS), i.e., minimum allowable signal-to-interference-and-noise ratio (SINR) at receiver and maximum tolerable SINR at eavesdroppers.The formulated design problem is shown to be nonconvex and we transfer it into linear matrix inequalities (LMIs).The semidefinite relaxation (SDR) technique is used and the approximated method is proved to solve the original problem exactly.To verify the robustness and tightness of proposed beamforming, we also provide a method to calculate the worst-case SINR at eavesdroppers for a designed transmit scheme using semidefinite programming (SDP).Additionally, the secrecy rate maximization is explored for fixed total transmit power.To tackle the nonconvexity of original formulation, we develop an iterative approach employing sequential parametric convex approximation (SPCA).The simulation results illustrate that the proposed robust transmit schemes can effectively improve the transmit performance.
In this letter, we consider secrecy communications over multiple-input single-output K-user interference channel in the presence of multiple eavesdroppers. Each legitimate data link is wiretapped by several eavesdroppers. To keep the eavesdroppers ignorant of the confidential messages, we propose a co-ordinated secure beamforming scheme for maximizing the secrecy sum-rate subject to the individual power constraint of each transmitter. To solve the resultant nonconvex problem, we approximate it into a few semidefinite programs (SDPs) by employing the semidefinite relaxation (SDR) technique and a conservative convex approximation. It is demonstrated experimentally that the proposed algorithm converges within a few iterations. Furthermore, we prove that the SDP problem obtained via SDR always yields a rank-one solution such that the SDR is tight. Simulations show the efficacy of the proposed scheme.