MétaCan
Menu
Back to cohort
Record W1983211924 · doi:10.1002/sec.30

Local fast re‐authentication for 3G‐WLAN interworking

2008· article· en· W1983211924 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueSecurity and Communication Networks · 2008
Typearticle
Languageen
FieldEngineering
TopicIPv6, Mobility, Handover, Networks, Security
Canadian institutionsUniversity of British Columbia
FundersNatural Sciences and Engineering Research Council of CanadaSultan Qaboos University
KeywordsComputer scienceComputer networkAKAAuthentication (law)Computer securityAuthentication protocolKey (lock)Internet securityProtocol (science)Security serviceInformation security

Abstract

fetched live from OpenAlex

Abstract Interworking third‐generation (3G) mobile communications systems and wireless local area networks (WLANs) is advantageous for both service providers and end users. However, securing such interworking architectures is a challenging task. EAP‐AKA is the security protocol adopted by 3GPP to achieve authentication in 3G‐WLAN interworking architectures. This paper proposes enhancements to EAP‐AKA to improve performance and security during re‐authentication. A novel protocol named local fast re‐authentication (LFR) is proposed to replace the re‐authentication protocols in EAP‐AKA. The EAP‐AKA key hierarchy is restructured to suit the needs of LFR. Evaluations show that LFR is superior to the re‐authentication protocols in EAP‐AKA in terms of performance and security. LFR has been tested by the automated validation of internet security protocols and applications (AVISPA) security verification tool and proved to be secure.. Copyright © 2008 John Wiley & Sons, Ltd.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.764
Threshold uncertainty score1.000

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.001
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.014
GPT teacher head0.219
Teacher spread0.204 · 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