MétaCan
Menu
Back to cohort
Record W2134444393 · doi:10.1109/wts.2007.4563332

Local fast re-authentication protocol for 3G-WLAN interworking architecture

2007· article· en· W2134444393 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
FieldEngineering
TopicIPv6, Mobility, Handover, Networks, Security
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsAuthentication protocolLightweight Extensible Authentication ProtocolChallenge-Handshake Authentication ProtocolComputer networkComputer scienceData Authentication AlgorithmGeneric Bootstrapping ArchitectureAuthentication (law)Chip Authentication ProgramChallenge–response authenticationProtocol (science)Message authentication codeComputer securityCryptography

Abstract

fetched live from OpenAlex

Many advantages are attained by integrating 3G and WLAN systems to form a 3G-WLAN interworking architecture. However, securing the architecture is a great challenge because of the number of vulnerabilities introduced. EAP-AKA is the authentication solution adopted by the 3GPP to secure accesses to 3G-WLAN architectures. Two types of EAP-AKA authentication are available, full authentication and fast re-authentication. This paper presents a localized fast re-authentication protocol to substitute the standard fast re-authentication protocol. The proposed protocol achieves faster re-authentication by locally performing the authentication procedure. A new keying framework is introduced to minimize authentication delays during re-authentication and handover operations.

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.001
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: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.941
Threshold uncertainty score0.760

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.015
GPT teacher head0.280
Teacher spread0.265 · 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