MétaCan
Menu
Back to cohort
Record W1985392579 · doi:10.1109/icc.2010.5502136

Efficient Group Signature Scheme Supporting Batch Verification for Securing Vehicular Networks

2010· article· en· W1985392579 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
TopicAdvanced Authentication Protocols Security
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsGroup signatureOverhead (engineering)Computer scienceScheme (mathematics)Signature (topology)Computer networkGroup (periodic table)Digital signatureDistributed computingPublic-key cryptographyComputer securityHash functionEncryptionMathematics

Abstract

fetched live from OpenAlex

In this paper, we propose an efficient group signature scheme supporting batch verification for securing vehicular networks. Through analytical and simulation evaluations, we demonstrate that the currently available group signature schemes may not be suitable for vehicular networks due to the highly imposed security overhead. The proposed scheme can mitigate the effect of the heavy security overhead by batch group signature verification. Furthermore, the proposed scheme not only enables vehicles to verify a large number of messages in a timely manner, but also improves the system performance in terms of the message loss ratio.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.962
Threshold uncertainty score0.573

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.008
GPT teacher head0.273
Teacher spread0.265 · 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