New Frontier of Communication Security on Radio Frequency Fingerprints Concealment
Bibliographic record
Abstract
Due to device-specific defects introduced during the hardware manufacturing process, the radio frequency fingerprint (RFF) can be extracted to identify wireless devices and further avoid spoofing attacks. Many effective RFF identification methods have been proposed based on either machine learning or deep learning. However, from the perspective of communication security, if the RFF of the transmitter can be easily extracted and identified, attackers can disguise themselves as legitimate transmitters by impersonating RFF and other means, thereby undermining the security of wireless communications. Therefore, concealing the RFF of legitimate transmitters from detection and camouflage attacks has become a highly challenging issue in the field of wireless communications. This article presents an active RFF concealment (RFFC) method, which removes the nonlinear features of the transmitter system, thereby preventing attackers from obtaining the transmitter's RFF and ensuring the identity security of the transmitter. To evaluate the performance of RFF concealing technology, we simulate seven types of RFFC systems, and collect datasets without and with RFFC technology. The simulation results show that the performance of traditional transmitter identification methods decreases sharply after RFFC. Especially in low signal-to-noise ratio environments and complex multipath channel conditions, the proposed RFFC technology makes the RFF features chaotic and difficult to detect, leading to dramatically reduced effectiveness of existing transmitter identification methods.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".