Secure Beamforming and Reflection Design for RIS-ISAC Systems Under Collusion of Passive and Active Eavesdroppers
Pith reviewed 2026-05-16 11:26 UTC · model grok-4.3
The pith
Joint base station beamforming and RIS reflection design maximizes secrecy rate in ISAC systems while meeting sensing constraints against colluding active and passive eavesdroppers.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The secrecy rate maximization problem, formulated over transmit beamforming, RIS reflection coefficients, and receive beamforming under sensing and power constraints, is solved by alternating optimization that decomposes the problem into three subproblems, each handled with quadratic penalty and successive convex approximation, yielding an iterative JBRD algorithm that achieves higher secrecy rates than baselines while preserving sensing performance.
What carries the argument
The joint beamforming and reflection design (JBRD) algorithm, which applies alternating optimization to subproblems of transmit beamforming, RIS reflection, and receive beamforming, using quadratic penalty and successive convex approximation to manage non-convexity.
If this is right
- Joint optimization of beamforming and RIS phases yields higher secrecy rates than separate designs while satisfying sensing performance constraints.
- The iterative algorithm converges and delivers measurable security gains in the presence of colluding eavesdroppers.
- Receive beamforming at the legitimate receiver contributes to further suppression of eavesdropper channels.
- The approach maintains the required sensing accuracy as an explicit constraint during secrecy maximization.
Where Pith is reading between the lines
- The same decomposition could support extensions to multi-target sensing or multiple legitimate users by adding corresponding linear constraints.
- Replacing the iterative solver with a learned model might reduce runtime for real-time adaptation when channel statistics change slowly.
- The framework suggests that RIS surfaces can simultaneously serve sensing and security functions, potentially simplifying hardware in spectrum-constrained deployments.
Load-bearing premise
Alternating optimization combined with quadratic penalty and successive convex approximation converges to solutions that substantially improve secrecy rate without violating the sensing constraints.
What would settle it
Numerical evaluation on the same channel realizations showing that the JBRD algorithm produces lower secrecy rates than beamforming-only optimization (with fixed random RIS phases) under identical sensing and power limits.
Figures
read the original abstract
In the paper, the physical-layer security for reconfigurable intelligent surface (RIS) aided integrated sensing and communication (ISAC) system is studied. There is an active eavesdropper (AE) as well as a passive eavesdropper (PE), and they cooperate each other. By joint base station beamforming and RIS reflection design, we aim to achieve the best secure data communications with guaranteed sensing performance. Mathematically, taking the constraints on sensing performance and transmission power in consideration, the system secrecy rate maximization problem is formulated with respect to transmit beamforming, RIS reflection, and receive beamforming. The formulated problem is non-convex and is decomposed to three subproblems by applying the alternating optimization (AO). For the decomposed subproblem, we utilize the quadratic penalty method and successive convex approximation (SCA) for the solution derivation. Thereafter, an iterative numerical algorithm, referred to as the joint beamforming and reflection design (JBRD) algorithm, is proposed. Finally, numerical results demonstrate the effectiveness and superiority of the proposed algorithm.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies physical-layer security in a RIS-aided ISAC system with colluding active and passive eavesdroppers. It formulates a secrecy-rate maximization problem subject to sensing-performance and transmit-power constraints over transmit beamforming, RIS reflection coefficients, and receive beamforming. The non-convex problem is decomposed into three subproblems via alternating optimization; each subproblem is handled with quadratic penalty and successive convex approximation, yielding the iterative JBRD algorithm whose effectiveness is illustrated by numerical results.
Significance. If the JBRD iterates can be shown to produce high-quality feasible points with quantifiable gaps, the work would supply a concrete design method for secure RIS-ISAC under eavesdropper collusion, a timely setting. The numerical comparisons indicate gains over baselines, yet the absence of convergence guarantees and optimality metrics limits the strength of the central claim that the design achieves the 'best' secure rate.
major comments (2)
- [JBRD algorithm section] The description of the JBRD algorithm (the iterative procedure obtained after AO decomposition and SCA/quadratic-penalty linearizations) supplies no convergence proof or even a stationarity guarantee for the original joint non-convex problem. Penalty-parameter schedules and linearization errors are chosen heuristically; without a supporting argument or a monotonicity result, the reported secrecy-rate improvements cannot be certified as reliably attaining the claimed optimum.
- [Numerical results section] Numerical results section: the presented curves demonstrate improvement over baselines but report neither optimality-gap metrics (e.g., comparison against a global solver on small instances) nor initialization-sensitivity tests. This leaves open whether the plotted 'best' secure rates are consistently attained or merely feasible local values.
minor comments (1)
- [Abstract] The abstract states that receive beamforming is part of the optimization variables, yet the title and problem statement emphasize only transmit beamforming and RIS reflection; a clarifying sentence on whether the combiner is jointly optimized or fixed would improve readability.
Simulated Author's Rebuttal
We thank the referee for the valuable feedback on our paper. We address the major comments point by point below and have made revisions to strengthen the manuscript where possible.
read point-by-point responses
-
Referee: The description of the JBRD algorithm (the iterative procedure obtained after AO decomposition and SCA/quadratic-penalty linearizations) supplies no convergence proof or even a stationarity guarantee for the original joint non-convex problem. Penalty-parameter schedules and linearization errors are chosen heuristically; without a supporting argument or a monotonicity result, the reported secrecy-rate improvements cannot be certified as reliably attaining the claimed optimum.
Authors: We agree that a formal convergence proof would be desirable. However, due to the combination of alternating optimization, quadratic penalty, and successive convex approximation, establishing a rigorous stationarity guarantee for the original non-convex problem is highly non-trivial and beyond the scope of this work. In the revised manuscript, we have included additional analysis in the JBRD algorithm section showing that the objective function is non-decreasing in each iteration under the chosen penalty schedule, supported by numerical evidence of convergence within 20-30 iterations across various scenarios. We have also clarified that the algorithm aims to provide effective practical solutions rather than provably optimal ones, consistent with many existing works on similar optimization problems in wireless communications. revision: partial
-
Referee: Numerical results section: the presented curves demonstrate improvement over baselines but report neither optimality-gap metrics (e.g., comparison against a global solver on small instances) nor initialization-sensitivity tests. This leaves open whether the plotted 'best' secure rates are consistently attained or merely feasible local values.
Authors: To address this concern, we have added new numerical results in the revised manuscript. Specifically, for small-scale systems where global optimization is feasible, we compare the secrecy rates achieved by JBRD with those from a global solver, reporting average optimality gaps of less than 3%. Furthermore, we have performed initialization-sensitivity tests by initializing the algorithm with 10 different random points and reporting the mean and standard deviation of the achieved secrecy rates, which show low variance indicating robustness to initialization. These results are included in the updated Section V and new Figure 7. revision: yes
Circularity Check
No significant circularity in derivation chain
full rationale
The paper formulates a secrecy-rate maximization problem directly from explicit system constraints on secrecy rate, sensing performance, and transmit power. It then applies standard alternating optimization to decompose the non-convex joint problem into three subproblems and solves each via quadratic penalty plus successive convex approximation, yielding the JBRD iterative algorithm. No step reduces a claimed prediction or first-principles result to a fitted parameter or self-defined quantity by construction; numerical results are presented as empirical validation of the algorithm rather than as a circular confirmation of the formulation itself. The derivation remains self-contained against the stated model and standard convex-approximation techniques.
Axiom & Free-Parameter Ledger
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
an iterative numerical algorithm, referred to as the joint beamforming and reflection design (JBRD) algorithm
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
ITU-R WP5D, Framework and overall objectives of the future develop- ment of IMT for 2030 and beyond,Rec. ITU-R M.2160-0, 2023
work page 2030
-
[2]
S. Lu, et al., Integrated sensing and communications: Recent advances and ten open challenges,IEEE Internet of Things Journal, vol. 11, no. 11, June 2024
work page 2024
-
[3]
R. Liu, M. Li, M. Zafari, B. Ottersten and A. L. Swindlehurst, Multi-domain optimization framework for ISAC: From electromagnetic shaping to network cooperation,IEEE Wireless Communications, doi: 10.1109/MWC.2025.3646980, 2026, to appear
-
[4]
W. Hong et al., Integrated sensing and communication (ISAC) channel model towards 3GPP 6G standardization: Modelling, validation, and application,IEEE Journal on Selected Areas in Communications, doi: 10.1109/JSAC.2026.3656257, 2026, to appear
-
[5]
B. Mukhiddinov, D. He, W. Yu, Optimizing sensing and communication trade-offs in MIMO: A hybrid approach for 6G ISAC systems,IEEE Transactions on Vehicular Technology, doi: 10.1109/TVT.2025.3628170, 2026, to appear
-
[6]
X. Lou, Wenchao Xia, Shuyi Chen, Hongbo Zhu Precoding for multi- static ISAC system with integrated active and passive sensing,IEEE Communications Letters, vol. 28, no. 9, Sept. 2024
work page 2024
-
[7]
K. Han, K. Meng, X. -Y . Wang and C. Masouros, Network-level ISAC design: State-of-the-art, challenges, and opportunities,IEEE Journal of Selected Topics in Electromagnetics, Antennas and Propagation, vol. 1, no. 1, pp. 65-83, Sept. 2025
work page 2025
- [8]
-
[9]
K. Han, K. Meng, C. Masouros, Sensing-secure ISAC: Ambiguity func- tion engineering for impairing unauthorized sensing,IEEE Transactions on Wireless Communications, vol. 25, 2025
work page 2025
-
[10]
M. Liu, Z. Zhou, Q. Shi, et al. Joint beamforming design for integrated sensing and communication systems with hybrid-colluding eavesdroppers, IEEE Transactions on Communications, vol. 73, no. 8, Aug. 2025
work page 2025
-
[11]
A. A. Al-Habob, O. A. Dobre, Y . Jing, Predictive beamforming approach for secure integrated sensing and communication with multiple aerial eavesdroppers,IEEE Transactions on Communications, vol. 73, no. 9, Sept. 2025
work page 2025
-
[12]
Z. Chen, et al., Secure transmission of integrated sensing and commu- nication systems with eavesdropper: From mainlode to sidelode deploy- ment,IEEE Transactions on Vehicular Technology, vol. 74, no. 9, Sept. 2025
work page 2025
-
[13]
Z. Chen, S. Zhu, X. Li, Near-field assisted secure ISAC system: Synergistic enhancement between sensing and secure transmission,IEEE Communications Letters, vol. 29, no. 10, Oct. 2025
work page 2025
-
[14]
B. Zhao, T. Qiu, Y . Ge, RSMA-enhanced secure precoding for ISAC systems with both active and passive eavesdroppers,Computer Networks, vol. 275, Feb. 2026
work page 2026
-
[15]
Z. Wang, Z. Mobini, H. Q. Ngo, H. Shin and M. Matthaiou, Anti- malicious ISAC: How to jointly monitor and disrupt your foes?,IEEE Transactions on Wireless Communications, vol. 25, pp. 10514-10529, 2026 12
work page 2026
-
[16]
C. Jiang, et al., Exploiting RIS in secure beamforming design for NOMA-assisted integrated sensing and communication,IEEE Internet of Things Journal, vol. 11, no. 17, Sept. 2024
work page 2024
-
[17]
Z. Yang, et al., Secure integrated sensing and communication systems assisted by active RIS,IEEE Transactions on Vehicular Technology, vol. 73, no. 12, Dec. 2024
work page 2024
-
[18]
J. Zhou, Y . Yang, Z. Yang and M. R. Shikh-Bahaei, Near-field extremely large-scale STAR-RIS enabled integrated sensing and communications, IEEE Transactions on Green Communications and Networking, vol. 9, no. 1, pp. 404-416, Mar. 2025
work page 2025
-
[19]
T. Zhou, et al., Robust and secure beamforming design for STAR-RIS- enabled IoE ISAC systems,IEEE Internet of Things Journal, vol. 12, no. 7, Apr. 2025
work page 2025
-
[20]
Y . Yao, et al., Optimizing hybrid RIS-aided ISAC systems in V2X networks: A deep reinforcement learning method for anti-eavesdropping techniques,IEEE Transactions on Vehicular Technology, vol. 74, no. 6, June 2025
work page 2025
-
[21]
C. Jiang, et al., RIS-assisted ISAC systems for robust secure transmission with imperfect sense estimation,IEEE Transactions on Wireless Commu- nications, vol. 24, no. 5, May 2025
work page 2025
-
[22]
Z. Wu, W. Zhang, Joint transmit and reflect beamforming design for active-RIS-assisted secure ISAC systems,IEEE Communications Letters, vol. 29, no. 8, Aug. 2025
work page 2025
-
[23]
V . Kumar and M. Chafii, Beamforming design for secure RIS-enabled ISAC: Passive RIS versus active RIS,IEEE Transactions on Wireless Communications, vol. 24, no. 9, pp. 7719-7732, Sept. 2025
work page 2025
-
[24]
Y . Yao, et al., Hybrid RIS-enhanced ISAC secure systems: Joint opti- mization in the presence of an extended target,IEEE Transactions on Communications, vol. 73, no. 12, Dec. 2025
work page 2025
-
[25]
E. Illi, et al., On the secrecy-sensing optimization of RIS-assisted full- duplex integrated sensing and communication network,IEEE Transac- tions on Wireless Communications, vol. 25, Dec. 2025
work page 2025
-
[26]
C. Dai, et al., Robust multi-agent reinforcement learning for physical layer security communication in RIS-assisted UA V-enabled ISAC net- works,IEEE Transactions on Network Science and Engineering, doi: 10.1109/TNSE.2025.3645894, Dec. 2025
-
[27]
W. Hao, et al., Secure energy efficiency optimization for sub-connected active RIS-assisted mmWave ISAC system,IEEE Transactions on Wire- less Communications, vol. 25, doi: 10.1109/TWC.2025.3607322
-
[28]
Y . Li, M. Jin, Q. Guo, J. Yao, T. Jiang and J. Liu, Secure beamforming and power allocation for RIS-assisted NOMA-ISAC systems with internal and external eavesdroppers,IEEE Transactions on Cognitive Communi- cations and Networking, vol. 12, pp. 896-911, 2026
work page 2026
-
[29]
S. Ma et al., Energy-efficient transmission in STAR-RIS assisted secure ISAC networks with RSMA: An MoE-RBPPO approach,IEEE Trans- actions on Vehicular Technology, doi: 10.1109/TVT.2026.3658351, 2026, to appear
-
[30]
M. Liu, Z. Zhou, Q. Shi, X. Lei and P. Fan, Minimization of secrecy outage probability for ARIS-aided ISAC systems,IEEE Transactions on Vehicular Technology, doi: 10.1109/TVT.2026.3657807, 2026, to appear
-
[31]
H. Bian et al., Movable antenna-enabled secure transmission for active RIS-aided ISAC systems,IEEE Transactions on Network Science and Engineering, doi: 10.1109/TNSE.2026.3657852, 2026, to appear
-
[32]
X. Yu, Z. Tan, Y . Yan and H. Zhu, Secure integrated sensing and commu- nication systems in the presence of illegal reconfigurable intelligent sur- face,IEEE Internet of Things Journal, doi: 10.1109/JIOT.2026.3656112, 2026, to appear
-
[33]
R. Zhao, X. Hu, C. Liu, et al. Joint transmit and receive beamforming design for secure communications in ISAC systems with eavesdropper and jammer,Proc. IEEE/CIC International Conference on Communica- tions in China (ICCC). IEEE, 2024: 885-890
work page 2024
-
[34]
M. Hua, Q. Wu, W. Chen, O. A. Dobre and A. L. Swindlehurst, Secure intelligent reflecting surface-aided integrated sensing and communication, IEEE Transactions on Wireless Communications, vol. 23, no. 1, pp. 575- 591, Jan. 2024
work page 2024
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.