MétaCan
Menu
Back to cohort
Record W1685618866

Bayesian networks for modeling failure dependency in access control models

2012· article· en· W1685618866 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

VenueWorld Congress on Internet Security · 2012
Typearticle
Languageen
FieldSocial Sciences
TopicAccess Control and Trust
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsAccess controlComputer scienceBayesian networkDependency (UML)Role-based access controlDependency graphFormalism (music)Distributed computingNotationGraphTheoretical computer scienceSoftware engineeringComputer securityArtificial intelligence
DOInot available

Abstract

fetched live from OpenAlex

Access controls are indispensable mechanisms for protecting access to resources of computing and communication systems. Currently, the design of access control models is centered on the access interaction between system subjects and objects. However, access authentication, control, auditing and administration services in today's systems do not enjoy full operational independence while interacting with systems assets. That is, in a way or another they interact across different platforms, programs, processes or users, leading to build certain dependency while in operation. The identification and evaluation of this dependency is crucial to meeting security goals of access control models. To tackle this issue, we introduce a modeling technique that captures probabilistically the interaction between system assets and controls into a graph theoretic paradigm. We use Bayesian Networks (BN) in particular to model and analyze this dependency. We briefly show the proposed abstraction, modeling formalism and associated notation, along with a demonstration example of various useful inferences and some suggested research directions.

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 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.815
Threshold uncertainty score1.000

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.002
Open science0.0010.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.034
GPT teacher head0.326
Teacher spread0.293 · 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