Strengthening Open Radio Access Networks: Advancing Safeguards Through ZTA and Deep Learning
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Open Radio Access Networks (O-RAN) are gaining momentum because of their ability to provide greater vendor flexibility, cost-effectiveness, and scalability, making it an attractive choice for network operators. However, securing O-RAN has become an essential concern due to the inherent vulnerabilities and risks associated with their open nature. Zero trust architecture (ZTA) can help address the security issues associated with O-RAN. ZTA is a security model that assumes that all devices, users, and applications are potentially hostile and cannot be trusted until verified. In addition to ZTA, the integration of deep learning techniques can allow for the detection and prevention of sophisticated cyber threats in real-time. In this work, we propose a novel approach to securing O-RAN using ZTA and Deep Sarsa reinforcement learning algorithms. First, we developed a ZTA model using an open-source approach that can be used as the base architecture for our study. Then, we present our proposed approach, which uses Deep Sarsa to learn the optimal policy for enforcing access control rules on the network resources based on user authentication data from ZTA. Finally, we evaluate our model using real data sets and show that it performs better than other approaches in terms of accuracy, F1 score, and precision. Our results demonstrate that combining ZTA with reinforcement learning is a promising way to help secure O-RAN while still providing flexible access control policies for operators.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it