MétaCan
Menu
Back to cohort
Record W2147610275 · doi:10.1109/glocom.2005.1577960

Vulnerability analysis of IP traceback schemes

2005· article· en· W2147610275 on OpenAlex
Lin Cai, Jianping Pan, Shen Su-bin

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

VenueGLOBECOM '05. IEEE Global Telecommunications Conference, 2005. · 2005
Typearticle
Languageen
FieldComputer Science
TopicNetwork Security and Intrusion Detection
Canadian institutionsUniversity of WaterlooUniversity of Victoria
Fundersnot available
KeywordsIP tracebackComputer scienceDenial-of-service attackExploitVulnerability (computing)Computer networkStateless protocolComputer securityNetwork packetContext (archaeology)Overhead (engineering)Probabilistic logicThe InternetBuffer overflowVulnerability assessment

Abstract

fetched live from OpenAlex

Distributed denial-of-service attacks pose a serious threat to today's Internet. To counter these attacks, many IP traceback schemes have been proposed; among them, distance-indexed probabilistic packet marking and its variants are attractive due to their stateless, low-overhead and incrementally-deployable design. However, some schemes may become vulnerable in practice, and the implication is yet to be quantified. In this paper, we first reveal these vulnerabilities. Sustained by efficacy analysis and numerical results, we then design several exploits that allow attackers to take full advantage of these vulnerabilities. We also examine the causes of these vulnerabilities as well as possible remedies, and discuss the distance-related buffer overflow in the context of network protocols.

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 categoriesMeta-epidemiology (narrow)
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.702
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.004
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0030.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.296
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