MétaCan
Menu
Back to cohort
Record W2290682109 · doi:10.1109/icitst.2015.7412069

Study of applicability of Chinese remainder theorem based group key management for cloud environment

2015· article· en· W2290682109 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSecurity in Wireless Sensor Networks
Canadian institutionsConcordia University of Edmonton
FundersConcordia University of Edmonton
KeywordsComputer scienceKey (lock)Chinese remainder theoremCloud computingKey managementGroup keyJavaTestbedDistributed computingComputationMulticastOperating systemComputer networkAlgorithmCryptographyEncryption

Abstract

fetched live from OpenAlex

This paper reports on applicability of the Chinese Remainder Theorem (CRT) based Group Key Management (CRTGKM) for cloud environment. The results of our experiments confirm that the cloud environment group key management schemes known as ACV-BGKM and AB-GKM require high computation time for key update and key recovery processes. Therefore, to reduce the computational cost, a CRTGKM algorithm of multimedia multicast environment is applied to cloud environment based on applicability criteria. JAVA-based testbed was developed for simulation of performance of various group key management schemes and for estimation of the computation time for key update and key recovery processes.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.701
Threshold uncertainty score0.517

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.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.021
GPT teacher head0.252
Teacher spread0.231 · 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

Quick stats

Citations6
Published2015
Admission routes2
Has abstractyes

Explore more

Same topicSecurity in Wireless Sensor NetworksFrench-language works237,207