Joint Secure Transceiver Design for Integrated Sensing and Communication
Bibliographic record
Abstract
This paper studies the joint secure transceiver design for the full-duplex integrated sensing and communication (ISAC) system, in which the base station performs the target tracking and communicates with the downlink and the uplink users by reusing the resources. Here, the target, referred to as Eve, is a potential eavesdropper with the intention of intercepting both the downlink and the uplink information. The security problem of the full-duplex ISAC system has not been studied well, where the sensing and communication signals suffer from the serious interference. In this paper, we jointly design the information beamformer, the radar waveform, the uplink communication receive filter, and the radar receive filter to achieve the downlink and uplink communication security and the target tracking. Specifically, both the Eve’s signal-to-interference-plus-noise ratio minimization and the secrecy rate maximization problems, subject to the sensing and the communication constraints, are formulated for the ISAC system from the perspectives of the quality of service and the secrecy rate. An iterative algorithm is proposed for solving the formulated problems. We prove that, under appropriate conditions, the proposed iterative algorithm converges to the Karush-Kuhn-Tucker optimal point of the original problem without the rank 1 constraint. We further extend the joint design to the case of the imperfect wiretap channel and the angle uncertainty. Numerical results show that our scheme remarkably outperforms the benchmark approaches. The performance is close to that of designing the secure communication and the sensing separately.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".