Enhancing broadcast authentication in sensor 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
Due to the nature of wireless sensor networks, security is a critical problem that needs to be further researched and developed. Resource constrained and usually unattended sensors are much vulnerable to malicious attackers that may impersonate the senders by altering broadcast messages. Authenticating received messages is a crucial matter that needs to be investigated closely in this regard. Recently proposed TESLA based techniques have embarked on resolving the authentication problem by employing symmetric encryption and achieving the desired security level by mimicking asymmetric encryption through delayed key disclosure. The suggested delay renders the network vulnerable to Denial of Service attack since an adversary can flood the nodes by sending bogus messages and forcing the sensors to buffer the messages until they receive the corresponding delayed keys. Several novel techniques have been proposed to achieve immediate authentication in TESLA methods to alleviate this threat. In the process, other factors such as reliability, security and buffer requirements may have been compromised which need careful consideration. In this paper a Low Buffer μ Tesla protocol which has been presented in [1] is adapted and is altered to achieve reliability by integrating a technique presented in [2]. The integrated method should be able to achieve immediate authentication while preserving desired security and reliability and reducing memory requirements in sensor nodes.
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