Enabling Secure Authentication in Industrial IoT With Transfer Learning Empowered Blockchain
Bibliographic record
Abstract
Industrial Internet of Things (IIoT) is ushering in huge development opportunities in the era of Industry 4.0. However, there are significant data security and privacy challenges during automatic and real-time data collection, monitoring for industrial applications in IIoT. Data security and privacy in IIoT applications are closely related to the reliability of users, which is determined by user authentication that have been widely used as an effective approach. However, the existing user authentication mechanisms in IIoT suffer from single factor authentication and poor adaptability with the rapid growth of the number of users and the diversity of user categories. To solve the aforementioned issues, this article proposes a novel Authentication mechanism based on Transfer Learning empowered Blockchain, coined ATLB. In ATLB, blockchains are applied to achieve the privacy preservation for industrial applications. In addition, by introducing the transfer learning based authentication mechanism, trustworthy blockchains are built such that the privacy preservation for industrial applications is further enhanced. Specifically, ATLB first employs a guiding deep deterministic policy gradient algorithm to train the user authentication model of a specific region, which is then transferred locally for foreign user authentication or cross-regionally for another region's user authentication such that the model training time is significantly reduced. Experimental results show that the proposed ATLB not only provides accurate authentications for IIoT applications but also achieves high throughput and low latency.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".