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

Qatar Foundation Annual Research Conference (ARC)

The Secure Degrees of Freedom of the MIMO BC and MIMO MAC with Multiple Unknown Eavesdroppers

Mohamed Khalil, Tamer M. Khattab, Tarek Elfouly, Amr Mahmoud Salem Mohamed

Published Jan 1, 2016• 0 citations
Publisher

Abstract

We investigate the secure degrees of freedom (SDoF) of a two-transmitter Gaussian multiple access channel with multiple antennas at the transmitters, a legitimate receiver and an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value NE. The channel matrices between the legitimate transmitters and the receiver are available everywhere, while the legitimate pair have no information about the fading eavesdroppers’ channels. We provide the exact sum SDoF for the considered system. We show that it is equal to min(M1 + M2 − NE, 1/2(max(M1;N2 + max(M2;N) − NE,N). A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that Cooperative Jamming is SDoF optimal even without the eavesdropper CSI available at the transmitters.

DOI
10.5339/qfarc.2016.ictsp2944

Related papers

Secure Degrees of Freedom of the MIMO Multiple Access Channel with Multiple unknown Eavesdroppers

Mohamed Amir, Tamer M. Khattab, Tarek Elfouly +1 more

We investigate the secure degrees of freedom (SDoF) of a two-transmitter Gaussian multiple access channel with multiple antennas at the transmitters, the legitimate receiver with the existence of an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value $N_E$. The channel matrices between the legitimate transmitters and the receiver are available everywhere, while the legitimate pair does not know the eavesdroppers' channels matrices. We provide the exact sum SDoF for the considered system. A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that Cooperative Jamming is SDoF optimal even without the instantaneous eavesdropper CSI available at the transmitters.

arXiv:1404.5007•Apr 20, 2014•4 citations

Secrecy for MIMO wiretap and MIMO broadcast channels with fading eavesdroppers: CSI does not increase the secure DoF

Mohamed Amir, Tamer M. Khattab, Tarek Elfouly +1 more

We investigate the secure degrees of freedom (SDoF) of the wiretap and the K user Gaussian broadcast channels with multiple antennas at the transmitter, the legitimate receivers and an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value NE. The channel matrices between the legitimate transmitter and the receivers are available everywhere, while the legitimate pair have no information about the eavesdroppers' channels. We provide the exact sum SDoF for the considered system. A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that cooperative jamming is SDoF optimal even without the eavesdropper CSI available at the transmitters.

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)•Aug 1, 2015•6 citations

On the Secure Degrees of Freedom of the K-user MAC and 2-user Interference Channels

Mohamed Amir, Tamer M. Khattab, Elfouly, Tarek

We investigate the secure degrees of freedom (SDoF) of the K-user MIMO multiple access (MAC) and the two user MIMO interference channel. An unknown number of eavesdroppers are trying to decode the messages sent by the transmitters. Each eavesdropper is equipped with a number of antennas less than or equal to a known value NE. The legitimate transmitters and receivers are assumed to have global channel knowledge. We present the sum SDoF of the two user MIMO interference channel. We derive an upperbound on the sum SDoF of the K-user MAC channel and present an achievable scheme that partially meets the derived upperbound.

arXiv:1603.09376•Jan 1, 2016•1 citation

The Effect of Transmitter's Eavesdropper CSI on the Secure Degrees of Freedom of the MIMO MAC

Mohamed Amir, Tamer M. Khattab

We investigate the secure degrees of freedom (SDoF) of the two-transmitter multiple access channel (MAC) with multiple antennas transmitters and multiple antennas legitimate receiver in the vicinity of an eavesdropper that has NE antennas. The SDoF is derived for two cases of the legitimate nodes knowledge about eavesdroppers' channels, instantaneous CSI and statistical CSI. Comparing the SDoF of the two cases, the effect of eavesdropper CSI knowledge on the SDoF is developed. We derive the exact sum SDoF for both cases and provide matching respective upperbounds. We show that obtaining statistical CSI can achieve even more SDoF in some cases than obtaining the instantaneous eavesdropper's channels coefficients if some time slots were dedicated to channel estimation.

IEEE Wireless Communications and Networking Conference•Mar 1, 2017•0 citations

On the degrees of freedom of MIMO Multiple access channel with multiple eavesdroppers.

Mohamed Amir, Tamer M. Khattab, Tarek Elfouly +1 more

Abstract—Two-transmitter Gaussian multiple access wiretap channel with multiple antennas at the transmitters, legitimate receivers and eavesdroppers is studied. The existence of unknown number of eavesdroppers is assumed but with maximum number of antennas at any eavesdropper limited to a known value NE. The channel matrices between the transmitters and the receiver is available everywhere, while the legitimate pair have no infor-mation about the eavesdroppers channels. A new upperbound is established and A new achievable DoF region is provided and meets the upperbound for the majority of the region. It is important to the same problem was studied with arbitrarily varying eavesdropper channels. Our achievable region is larger than their upperbound. I.

•Apr 20, 2014•0 citations

On the Secure Degrees of Freedom of the K User MIMO MAC with Statistical CSI

Mohamed Amir, Tamer M. Khattab

We investigate the secure degrees of freedom (SDoF) of the -user MIMO multiple access channel (MAC) in the vicinity of an eavesdropper which is trying to decode the messages sent by the transmitters. The eavesdropper is equipped with antennas and has fading channels. The transmitters and the legitimate receiver are assumed to be oblivious of the eavesdropper channels values. We derive an upperbound on the sum SDoF of such -user MAC channel and present an achievable scheme that partially meets the derived upperbound.

IEEE Wireless Communications and Networking Conference•Mar 1, 2017•3 citations
We investigate the secure degrees of freedom (SDoF) of a two-transmitter Gaussian multiple access channel with multiple antennas at the transmitters, a legitimate receiver and an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value NE. The channel matrices between the legitimate transmitters and the receiver are available everywhere, while the legitimate pair have no information about the fading eavesdroppers’ channels. We provide the exact sum SDoF for the considered system. We show that it is equal to min(M1 + M2 − NE, 1/2(max(M1;N2 + max(M2;N) − NE,N). A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that Cooperative Jamming is SDoF optimal even without the eavesdropper CSI available at the transmitters.
We investigate the secure degrees of freedom (SDoF) of a two-transmitter Gaussian multiple access channel with multiple antennas at the transmitters, the legitimate receiver with the existence of an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value NEN_ENE​. The channel matrices between the legitimate transmitters and the receiver are available everywhere, while the legitimate pair does not know the eavesdroppers' channels matrices. We provide the exact sum SDoF for the considered system. A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that Cooperative Jamming is SDoF optimal even without the instantaneous eavesdropper CSI available at the transmitters.
We investigate the secure degrees of freedom (SDoF) of the wiretap and the K user Gaussian broadcast channels with multiple antennas at the transmitter, the legitimate receivers and an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value NE. The channel matrices between the legitimate transmitter and the receivers are available everywhere, while the legitimate pair have no information about the eavesdroppers' channels. We provide the exact sum SDoF for the considered system. A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that cooperative jamming is SDoF optimal even without the eavesdropper CSI available at the transmitters.
We investigate the secure degrees of freedom (SDoF) of the K-user MIMO multiple access (MAC) and the two user MIMO interference channel. An unknown number of eavesdroppers are trying to decode the messages sent by the transmitters. Each eavesdropper is equipped with a number of antennas less than or equal to a known value NE. The legitimate transmitters and receivers are assumed to have global channel knowledge. We present the sum SDoF of the two user MIMO interference channel. We derive an upperbound on the sum SDoF of the K-user MAC channel and present an achievable scheme that partially meets the derived upperbound.
We investigate the secure degrees of freedom (SDoF) of the two-transmitter multiple access channel (MAC) with multiple antennas transmitters and multiple antennas legitimate receiver in the vicinity of an eavesdropper that has NE antennas. The SDoF is derived for two cases of the legitimate nodes knowledge about eavesdroppers' channels, instantaneous CSI and statistical CSI. Comparing the SDoF of the two cases, the effect of eavesdropper CSI knowledge on the SDoF is developed. We derive the exact sum SDoF for both cases and provide matching respective upperbounds. We show that obtaining statistical CSI can achieve even more SDoF in some cases than obtaining the instantaneous eavesdropper's channels coefficients if some time slots were dedicated to channel estimation.
Abstract—Two-transmitter Gaussian multiple access wiretap channel with multiple antennas at the transmitters, legitimate receivers and eavesdroppers is studied. The existence of unknown number of eavesdroppers is assumed but with maximum number of antennas at any eavesdropper limited to a known value NE. The channel matrices between the transmitters and the receiver is available everywhere, while the legitimate pair have no infor-mation about the eavesdroppers channels. A new upperbound is established and A new achievable DoF region is provided and meets the upperbound for the majority of the region. It is important to the same problem was studied with arbitrarily varying eavesdropper channels. Our achievable region is larger than their upperbound. I.
We investigate the secure degrees of freedom (SDoF) of the -user MIMO multiple access channel (MAC) in the vicinity of an eavesdropper which is trying to decode the messages sent by the transmitters. The eavesdropper is equipped with antennas and has fading channels. The transmitters and the legitimate receiver are assumed to be oblivious of the eavesdropper channels values. We derive an upperbound on the sum SDoF of such -user MAC channel and present an achievable scheme that partially meets the derived upperbound.