A certificate revocation scheme for wireless ad hoc networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The increasing prominence of wireless ad hoc networks is stimulating greater interest in developing adequate security mechanisms for securing applications involving these innovative networks paradigms. To-date, the proposed security schemes either provide inadequate security or they are too costly computationally, and therefore impractical for most ad hoc network applications.Adapting wired network security schemes---particularly those involved digital certificates---to wireless ad hoc networks environments, poses many difficulties, primarily for two reasons: the limitation of computational resources, and the absence of centralized entities for performing critical key management tasks such as certificate revocation.In this paper, we propose a certificate revocation scheme for wireless ad hoc networks. Our revocation scheme not only provides a measure of protection against malicious accusation attacks, but it also effectively eliminates the window of opportunity whereby revoked certificates can be used to access network services.
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.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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 it