Lightweight Flexible Group Authentication Utilizing Historical Collaboration Process Information
Bibliographic record
Abstract
Existing device authentication techniques may suffer from heavy communication, computation, and storage overhead for identifying a growing number of devices in collaborations. This paper proposes a novel group authentication (GA) method for decentralized edge collaboration by exploiting the historical collaboration process information, i.e., the distributed learning parameters and results from the previous round of collaboration. Two strategies are developed to generate tokens locally at the edge devices’ side for mutual authentication, named random token generation (R-TG) and privacy-preserving token generation (PP-TG). Specifically, the R-TG strategy randomly selects several historical learning parameters as tokens, while the PP-TG strategy designs a one-way function to defend against privacy leakage by concealing the historical information. A GA protocol is proposed, where each device simultaneously authenticates the others in the same group by repeating the learning process using their tokens. If the process converges to an expected result, all the devices are authenticated as legitimate group members at once. The proposed scheme provides a lightweight flexible solution without pre-generating and distributing any keys/secrets operating on top of a standardized security protocol, and protects the collaboration continuously. The simulation results demonstrate the viability of our scheme and its superior performance compared to several benchmark schemes.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 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".