Toward Secure and Provable Authentication for Internet of Things: Realizing Industry 4.0
Bibliographic record
Abstract
The Internet of Things (IoT) has many applications, including Industry 4.0. There are a number of challenges when deploying IoT devices in the Industry 4.0 setting, partly due to the low-cost IoT devices/nodes with limited capacity to run/support security solutions. Hence, there is a need for a lightweight and efficient security solution to protect the environment. Thus, in this article, we present a robust, lightweight, and provably secure authentication and key agreement protocol specifically for the IoT environment based on a hierarchical approach. The proposed protocol relies on lightweight operations, such as elliptic curve cryptography, physically unclonable functions, hash functions, concatenation, and XOR operations. We then evaluate the security of the designed protocol, including the widely used automated validation of Internet security protocols and applications (AVISPA), and demonstrate that it supports mutual authentication between IoT nodes and server, and is resilient against a number of common security attacks [denial of service (DoS), replay, spoofing, etc.]. The computational and communication overhead analysis shows that the proposed protocol is comparatively less expensive than three other recently published, competing protocols.
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.004 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.005 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.002 | 0.003 |
| 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".