MétaCan
Menu
Back to cohort
Record W65480259

The BNAI Analyzer: A Tool for Verifying Admissible Information Flow in Protocols.

2002· article· en· W65480259 on OpenAlexaff
Gaétan Hains, Matthieu Bergeron

Bibliographic record

VenueIASTED PDCS · 2002
Typearticle
Languageen
FieldComputer Science
TopicPhysical Unclonable Functions (PUFs) and Hardware Security
Canadian institutionsPolytechnique Montréal
Fundersnot available
KeywordsComputer scienceProperty (philosophy)Protocol (science)Information flowBisimulationState (computer science)Cryptographic protocolTheoretical computer scienceFinite-state machineConfidentialityDistributed computingProgramming languageAlgorithmComputer securityCryptography
DOInot available

Abstract

fetched live from OpenAlex

We present a tool for verifying a new security property of protocols namely bisimulation-based non-deterministic admissible interference or BNAI. This property specifies the absence of information flow from confidential channels to public ones in selected parts of the protocol’s execution. The tool’s first version applies to protocols described by finite-state communicating processes and outputs detailed diagnostics in the case of inadmissible information flow. Examples illustrate the difficulty of ensuring the BNAI property by visual inspection of the protocol’s transition system and hence the tools usefulness. Future versions will apply to families of infinite-state processes and one of them is outlined here.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.005
metaresearch head score (Gemma)0.020
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
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.007
Threshold uncertainty score0.024

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.020
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.002
Scholarly communication0.0020.004
Open science0.0020.003
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0070.003

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.026
GPT teacher head0.256
Teacher spread0.230 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2002
Admission routes1
Has abstractyes

Explore more

Same venueIASTED PDCSSame topicPhysical Unclonable Functions (PUFs) and Hardware SecurityFrench-language works237,207