Secure and Efficient Federated Learning for Robust Intrusion Detection in IoT Networks
Bibliographic record
Abstract
The rapid expansion of the Internet of Things (IoT) has increased the demand for robust intrusion detection systems. Federated learning (FL) has appeared as a potential solution to improve the security of IoT networks by facilitating collaboration between multiple devices in training a unified model while keeping their data secure. As the training process of FL occurs locally on individual devices, preserving data privacy becomes crucial. Additionally, combining model updates from multiple devices into a unified model can be challenging. Therefore, addressing these issues is critical to effective and private FL-based intrusion detection in IoT networks. In this paper, we propose a novel approach for ensuring privacy and efficiency in FL for robust intrusion detection in the IoT. Our approach combines secure aggregation and blockchain technology to protect the privacy of IoT data while enabling efficient and accurate model training. We first introduce a secure aggregation algorithm that can be used to combine the model updates from multiple devices in a privacy-preserving manner. This algorithm uses multi-party computation to prevent any single party from seeing the data of the other parties, thereby ensuring that the privacy of IoT data is maintained throughout the model training process. Then, we incorporate the use of blockchain technology to ensure data integrity and prevent tampering. Finally, we perform experiments on real-world IoT datasets to demonstrate the effectiveness of our approach. Our results show that our approach achieves high accuracy in intrusion detection while preserving the privacy of the IoT data.
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 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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".