MétaCan
Menu
Back to cohort

Enclave Application Cache for RISC-V Keystone

2025· article· en· W4413886689 on OpenAlexfundno aff
Takumu Umezawa, Akihiro Saiki, Keiji Kimura

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicParallel Computing and Optimization Techniques
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceCacheOperating systemEmbedded system

Abstract

fetched live from OpenAlex

The development of the IoT society and the spread of cloud computing have also increased the number of insecure devices and vulnerable host OSs. We must protect the applications that deal with sensitive information, even from untrusted OSs. Trusted execution environment (TEE) technologies have attracted much attention because they enable an isolated, secure program execution environment from OSs. However, the booting phase of application execution in a TEE requires an expensive hash calculation in the measurement process for its executable binary image to guarantee its integrity. To mitigate this overhead, this paper proposes an enclave application cache mechanism for RISC-V Keystone, a representative RISC-V TEE. It bypasses the measurement process by storing the previously executed binary image in a secure memory space. The performance evaluation shows the proposed cache can achieve a$6-40 \times$speedup in a TEE application's execution time.

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.000
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.003
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0010.002
Open science0.0020.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0030.001

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.010
GPT teacher head0.291
Teacher spread0.281 · 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 designBench or experimental
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

Citations2
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicParallel Computing and Optimization TechniquesFrench-language works237,207