MétaCan
Menu
Back to cohort
Record W2113876959 · doi:10.1109/cse.2009.157

Combining Attribute-Based and Access Systems

2009· article· en· W2113876959 on OpenAlexafffund
Behzad Malek, Ali Miri

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCryptography and Data Security
Canadian institutionsUniversity of Ottawa
FundersOntario Centres of Excellence
KeywordsAccess controlSystem administratorComputer scienceComputer access controlRole-based access controlAttribute-based encryptionEncryptionComputer securitySet (abstract data type)Mandatory access controlDiscretionary access controlWork (physics)Access structureControl (management)Public-key cryptographyCryptographySecret sharing

Abstract

fetched live from OpenAlex

In this work, we design a balanced access control system,where a robust system becomes flexible to meet its users'needs. On one hand, the system administrator sets system wide policies that all users must comply with. Policies are integrated into private keys of users, setting an access structure over attributes (resources) they can access. On the other hand, users are able to set their own access structure over system policies for documents they generate in the system. Users are in control of who and under what conditions can access their documents. This way, a system administrator can help users set their own access control policies while both users' privacy and system's security are preserved. Our system is based on two attribute-based encryption schemes: KP-ABE and CP-ABE. The former puts access policies into decryption keys, and the latter combines access policies with ciphertexts. In our work, we show how these two separate systems can be efficiently combined into a flexible, yet robust access control system.

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.008
metaresearch head score (Gemma)0.009
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.008
Threshold uncertainty score0.044

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.009
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.003
Scholarly communication0.0050.012
Open science0.0020.007
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0020.002

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.027
GPT teacher head0.275
Teacher spread0.248 · 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 designTheoretical or conceptual
Domainnot available
GenreMethods

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

Citations20
Published2009
Admission routes2
Has abstractyes

Explore more

Same topicCryptography and Data SecurityFrench-language works237,207