MétaCan
Menu
Back to cohort
Record W2076702673 · doi:10.1142/s0129626410000211

ONE-TIME PADS WITHOUT PRIOR ENCOUNTER

2010· article· en· W2076702673 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

VenueParallel Processing Letters · 2010
Typearticle
Languageen
FieldComputer Science
TopicQuantum Information and Cryptography
Canadian institutionsQueen's University
Fundersnot available
KeywordsSecrecyEncryptionComputer scienceCryptographyKey (lock)Value (mathematics)Transmission (telecommunications)Computer networkComputer securityAlgorithmTheoretical computer scienceTelecommunications

Abstract

fetched live from OpenAlex

Using one-time pads is the only cryptographic solution that really ensures the secrecy of a transmitted message. The communicating parties have to meet in advance to establish the value of any one-time pad. This means that the two parties have to meet regularly to renew the batch of one-time pads they share. By contrast, we show that after developing a secret reading mask using any quantum key distribution algorithm, the two parties can communicate indefinitely by encrypting each of their messages with a one-time pad. The value of the one-time pad is quantum encrypted and transmitted prior to the transmission of the message itself.

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.000
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.722
Threshold uncertainty score0.781

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.233
Teacher spread0.224 · 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