MétaCan
Menu
Back to cohort
Record W65315068

A Hybrid Group Key Management Protocol for Reliable and Authenticated Rekeying

2008· article· en· W65315068 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSecurity in Wireless Sensor Networks
Canadian institutionsDalhousie University
Fundersnot available
KeywordsRekeyingComputer scienceGroup keyMulticastCommunication in small groupsKey managementComputer networkKey (lock)Node (physics)Secure multicastComputer securityOverhead (engineering)Tree (set theory)Session keyDistributed computingReliable multicastSource-specific multicastEncryption
DOInot available

Abstract

fetched live from OpenAlex

We present a hybrid group key management protocol that incorporates both a centralized and a contributory scheme for key management, and a tree-based Elliptic Curve Diffie-Hellman technique for group key updates. It combines the advantage of the centralized approach’s efficiency and the contributory scheme’s fault tolerance. In addition, our rekeying algorithm updates the group key in the presence of any sequence of node failures, node restorations, and membership changes. Furthermore, our scheme incorporates a reliable and authenticated rekeying message transport method. Performance analysis indicates that our protocol reduces computational costs and communication overhead as compared to other popular protocols.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.840
Threshold uncertainty score0.497

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.030
GPT teacher head0.267
Teacher spread0.237 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations17
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicSecurity in Wireless Sensor NetworksFrench-language works237,207