MétaCan
Menu
Back to cohort
Record W2108167253 · doi:10.1109/iita.2008.87

Threshold Cryptosystem Based Fair Off-Line E-cash

2008· article· en· W2108167253 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCryptography and Data Security
Canadian institutionsThe Alberta Paraplegic Foundation
Fundersnot available
KeywordsElectronic cashComputer scienceTracingCryptosystemCryptographyComputer securityEncryptionPublic-key cryptographyPaymentOperating system

Abstract

fetched live from OpenAlex

The paper analyzed the security threats and system flaws of present e-cash schemes. Combining (t,n) threshold cryptography and e-cash, we present a threshold fair off-line e-cash scheme based on ECC ( Elliptic Curve Cryptosystem) . The scheme can trace the user identity and e-cash by embedding identity mark in e-cash generating and exchanging, and thus effectively prevents such illegal usage of e-cash as bribery and blackmailing, etc. By utilizing secret key sharing and probabilistic encryption algorithm, the scheme achieves threshold management of private key, avoids the misuse of identity tracing and currency tracing in fair e-cash scheme. The scheme achieves effective supervision on identity and e-cash tracing for fair electronic commerce, it also prevents coalition attack, intruder-in-middle attack and generalized e-cash forgery. Further analyses and comparison with other e-cash schemes also justify the scheme's brevity, security, high efficiency, and thus considerable improvement on system efficiency regarding software and hardware application.

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

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.031
GPT teacher head0.237
Teacher spread0.206 · 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

Citations17
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicCryptography and Data SecurityFrench-language works237,207