Linear and Numerical SDoF Bounds of Active RIS-Assisted MIMO Wiretap Interference Channel

📅 2025-06-18
📈 Citations: 0
Influential: 0
📄 PDF

career value

198K/year
🤖 AI Summary
This work investigates the secure degrees of freedom (SDoF) of a multiple-input multiple-output (MIMO) interference channel (IC) under eavesdropping, assisted by an active reconfigurable intelligent surface (RIS). It establishes, for the first time, fundamental information-theoretic security limits in the presence of multi-antenna eavesdroppers. Methodologically, we propose a joint design framework integrating linear beamforming with integer linear programming to derive the first achievable SDoF lower bound; we further obtain a tight numerical upper bound via nuclear norm minimization and convex relaxation of the rank function. For symmetric antenna configurations, a closed-form lower bound is derived. Our RIS element coordination strategy effectively suppresses signal leakage and inter-user interference. Numerical results demonstrate that the proposed bounds are highly tight across diverse antenna configurations, and the lower bound significantly outperforms existing benchmarks—thereby providing both theoretical foundations and practical design guidelines for RIS-enabled physical-layer security.

Technology Category

Application Category

📝 Abstract
The multiple-input multiple-output (MIMO) wiretap interference channel (IC) serves as a canonical model for information-theoretic security, where a multiple-antenna eavesdropper attempts to intercept communications in a two-user MIMO IC system. The secure degrees-of-freedom (SDoF) of an active reconfigurable intelligent surface (RIS)-assisted MIMO wiretap IC is with practical interests but remains unexplored. In this paper, we establish both sum-SDoF lower and upper bounds through linear beamforming conditions and numerical methods. Specifically, our proposed lower bound is derived from transmission scheme design and corresponding solutions to the sum-SDoF maximization problem, formulated by linear integer programming. The solutions to this optimization problem addresses RIS element allocation for leakage and interference cancellation. The proposed upper bound is obtained by solving a nuclear norm minimization problem, leveraging the fact that nuclear norm serves as a convex relaxation of the rank function. For symmetry antenna configurations, we derive a closed-form lower bound. Extensive numerical simulations show that our proposed lower and upper bounds coincide across many antenna configurations, and our proposed lower bound outperforms the existing benchmark.
Problem

Research questions and friction points this paper is trying to address.

Establishes SDoF bounds for active RIS-assisted MIMO wiretap IC
Derives lower bound via linear beamforming and integer programming
Obtains upper bound through nuclear norm minimization
Innovation

Methods, ideas, or system contributions that make the work stand out.

Active RIS-assisted MIMO wiretap IC
Linear integer programming for sum-SDoF
Nuclear norm minimization for upper bound
🔎 Similar Papers
No similar papers found.
L
Linfan Su
National Engineering Laboratory for Mobile Network Security, BUPT, Beijing, China
Y
Yuhang Miao
Guangdong Provincial Key Laboratory of Aerospace Communication and Networking Technology, Harbin Institute of Technology (Shenzhen), Shenzhen, China
Yuxuan Song
Yuxuan Song
Tsinghua University
Deep Generative ModelsLLM4Science,
Z
Zheng Shuo
Department of Electrical and Electronic Engineering, The Hong Kong Polytechnic University, Hong Kong SAR, China
T
Tong Zhang
Guangdong Provincial Key Laboratory of Aerospace Communication and Networking Technology, Harbin Institute of Technology (Shenzhen), Shenzhen, China; National Mobile Communications Research Laboratory, Southeast University, China
Yinfei Xu
Yinfei Xu
Southeast University
Information TheorySignal ProcessingWireless CommunicationsMachine Learning
S
Shuai Wang
Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China
N
Na Li
National Engineering Laboratory for Mobile Network Security, BUPT, Beijing, China