"Security for Everyone" in Finite Blocklength IRS-aided Systems With Perfect and Imperfect CSI

Monir Abughalwa, Diep N. Nguyen, Dinh Thai Hoang, Van‐Dinh Nguyen, Ming Zeng, Quoc‐Viet Pham, Eryk DutkiewiczarXiv 2025 · DOI · arXiv

Abstract

Provisioning secrecy for all users, given the heterogeneity in their channel conditions, locations, and the unknown location of the attacker/eavesdropper, is challenging and not always feasible. The problem is even more difficult under finite blocklength constraints that are popular in ultra-reliable low-latency communication (URLLC) and massive machine-type communications (mMTC). This work takes the first step to guarantee secrecy for all URLLC/mMTC users in the finite blocklength regime (FBR) where intelligent reflecting surfaces (IRS) are used to enhance legitimate users' reception and thwart the potential eavesdropper (Eve) from intercepting. To that end, we aim to maximize the minimum secrecy rate (SR) among all users by jointly optimizing the transmitter's beamforming and IRS's passive reflective elements (PREs) under the FBR latency constraints. The resulting optimization problem is non-convex and even more complicated under imperfect channel state information (CSI). To tackle it, we linearize the objective function, and decompose the problem into sequential subproblems. When perfect CSI is not available, we use the successive convex approximation (SCA) approach to transform imperfect CSI-related semi-infinite constraints into finite linear matrix inequalities (LMI). We prove that our proposed algorithm converges to a locally optimal solution with low computational complexity thanks to our closed-form linearization approach. This makes the solution scalable for large IRS deployments. Extensive simulations with practical settings show that our approach can ensure secure communication for all users while satisfying FBR constraints even with only imperfect CSI.

Introduction

As wireless networks evolve toward the next generation of connectivity, Ultra-Reliable Low-Latency Communication (URLLC) has become a cornerstone for the Internet of Things (IoT). However, traditional security models often rely on the "Long Blocklength Regime" (LBR), which assumes packets are long enough to push transmission errors and information leakage toward zero. In real-world URLLC applications—such as autonomous drones or industrial sensors—short packets are used to minimize latency. In this Finite Blocklength Regime (FBR), error and leakage are inherently non-zero, making secrecy significantly harder to maintain.

This research addresses the critical gap of ensuring "Security for Everyone" by utilizing Intelligent Reflecting Surfaces (IRS) to optimize signal reflections. The goal is to maximize the minimum secrecy rate across all users, ensuring fairness even when channel state information (CSI) is imperfect.

System Architecture

The proposed system model considers a downlink scenario where a multi-antenna Base Station (Alice) communicates with multiple legitimate users in the presence of a potential eavesdropper (Eve). To enhance security and signal quality, an IRS is deployed on a nearby building facade to reflect signals toward legitimate users and create destructive interference at the eavesdropper's location.

System model for IRS-aided secure communication with multiple users and an eavesdropper.

The environment is modeled with Rician fading channels, accounting for spatial correlation and path loss typical of urban settings where direct line-of-sight may be obstructed. By jointly optimizing Alice's beamforming and the IRS's passive reflective elements (PREs), the system can dynamically adapt to the users' locations and channel conditions.

Optimization Strategy

The core challenge lies in the non-convex nature of the FBR secrecy rate formula, which involves complex dispersion factors and "unit modulus" constraints for the IRS elements. To solve this, the authors employ several advanced mathematical techniques:

  1. Successive Convex Approximation (SCA): Linearizes the objective function into a series of manageable sub-problems.
  2. S-Procedure: Transforms "semi-infinite" constraints—arising from bounded channel estimation errors—into finite Linear Matrix Inequalities (LMIs) that can be solved efficiently.
  3. Penalty Convex-Concave Procedure (PCCP): Specifically handles the IRS phase-shift constraints, ensuring the elements only shift the phase without altering signal magnitude.
The PCCP algorithm used to solve the non-convex optimization problem for IRS phase shifts.

This closed-form linearization approach ensures the algorithm is computationally light and scalable, making it viable for large-scale IRS deployments with many reflecting elements ($M$).

Key Results and Insights

Numerical simulations demonstrate several critical findings for secure, low-latency networks:

  • Fairness and the Max-Min Approach: Unlike standard Sum Secrecy Rate (SSR) methods that might sacrifice the security of distant users to boost total network performance, the Max-Min approach achieves a Jain’s Fairness Index near 1.0. This ensures even the most vulnerable user meets a minimum security threshold.
  • The FBR Penalty: The research quantifies how the "shortness" of packets in FBR acts as a physical limit on secrecy. However, even at ultra-low latencies (0.1 ms), the system maintains a positive secrecy rate for all users.
  • Robustness to Uncertainty: By utilizing the S-procedure, the framework remains secure even when the estimated channel to the eavesdropper is inaccurate (e.g., an uncertainty level of $\delta = 0.04$).
  • Efficiency: The iterative algorithms typically reach a locally optimal solution in fewer than 10 iterations, proving their suitability for real-time applications.

Conclusion

This work provides a robust framework for guaranteeing secrecy in the finite blocklength regime, essential for the future of URLLC and mMTC. By leveraging IRS and advanced optimization techniques, the proposed system ensures that security is not just a network-wide metric, but a guarantee for every individual user. Future research will look toward multi-antenna eavesdroppers and multi-hop IRS scenarios to further extend these security benefits into deep-indoor environments.

Summary updated

Abstract

Provisioning secrecy for all users, given the heterogeneity in their channel conditions, locations, and the unknown location of the attacker/eavesdropper, is challenging and not always feasible. The problem is even more difficult under finite blocklength constraints that are popular in ultra-reliable low-latency communication (URLLC) and massive machine-type communications (mMTC). This work takes the first step to guarantee secrecy for all URLLC/mMTC users in the finite blocklength regime (FBR) where intelligent reflecting surfaces (IRS) are used to enhance legitimate users' reception and thwart the potential eavesdropper (Eve) from intercepting. To that end, we aim to maximize the minimum secrecy rate (SR) among all users by jointly optimizing the transmitter's beamforming and IRS's passive reflective elements (PREs) under the FBR latency constraints. The resulting optimization problem is non-convex and even more complicated under imperfect channel state information (CSI). To tackle it, we linearize the objective function, and decompose the problem into sequential subproblems. When perfect CSI is not available, we use the successive convex approximation (SCA) approach to transform imperfect CSI-related semi-infinite constraints into finite linear matrix inequalities (LMI). We prove that our proposed algorithm converges to a locally optimal solution with low computational complexity thanks to our closed-form linearization approach. This makes the solution scalable for large IRS deployments. Extensive simulations with practical settings show that our approach can ensure secure communication for all users while satisfying FBR constraints even with only imperfect CSI.
BibTeX
@misc{abughalwa2025security,
  author = {Monir Abughalwa and Diep N. Nguyen and Dinh Thai Hoang and Van‐Dinh Nguyen and Ming Zeng and Quoc‐Viet Pham and Eryk Dutkiewicz},
  title = {{"Security for Everyone" in Finite Blocklength IRS-aided Systems With Perfect and Imperfect CSI}},
  year = {2025},
  eprint = {2504.05067},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2504.05067},
  howpublished = {arXiv},
}
Figure