An authenticated broadcasting scheme for wireless ad hoc network
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
We propose a pairing-based signcryption scheme for authenticated broadcasting, which requires less computation than a previously proposed scheme that suggested an identity-based cryptosystem for ad hoc networks. Due to the dynamic nature of ad hoc networks, we allow nodes to generate their own broadcast keys for different groups in the network, and change those when associated groups are changed. However, we ensure through our signcryption scheme that broadcast keys are implicitly controlled by the trusted authority (TA), and can be used for as long as the private keys are issued. Our keys are based on identities and do not use certificates. We also propose a non-probabilistic method for computing unique broadcast keys for different groups. We use identity-based pairwise symmetric keys as the building block for our broadcast scheme. Such keys are computed non-interactively by the nodes, which reduces communication overhead and simplifies key management in pairwise communication.
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.001 |
| 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