Secure Authentication and Key Agreement Protocol for Tactile Internet-based Tele-Surgery Ecosystem
Bibliographic record
Abstract
With the recent advancements in wireless communications, Tactile Internet (TI) has witnessed a major blow. TI is considered the next big evolution that will provide real-time control in industrial setups, particularly in the domain of tele-surgery. However, in remote-surgery ecosystems the transmission of data is prone to different attack vectors. Thus, to realize the true potential of secure tele-surgery under the umbrella of TI, it is required to design a secure authentication and key agreement protocol for tele-surgery. In this paper, we present an effective and secure mutual authentication and session establishment protocol for TI-driven remote surgery setups. The designed protocol enables secure communications between the surgeon, robotic arm, and the trusted authority (TA); where the protocol leverages the advantages of Elliptic Curve Cryptography (ECC) and biometrics. The protocol operates along the following three phases: i) setup phase, ii) registration phase, and iii) mutual authentication and key agreement phase. During the third phase, the surgeon and the robotic arm mutually authenticate each other with the help of the TA. Further, the security features of the designed protocol have been established using formal and informal means. The obtained results indicate the resiliency of the protocol against offline password guessing attacks, replay attacks, impersonation attacks, man-in-the-middle attacks, denial of service attacks, etc.
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.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
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".