Metraipolis › archive › dc_18143adc2fa5

Protocol effects on feature-based hardware-Trojan detection across Trust-Hub families — arXiv:2609.07199

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.07199
License (as archived)
CC0-1.0
Archived
2026-10-16T13:32:15.074Z
SHA-256 of the archived text
5e216559f4730aa2acdbe3eae9fe1570c8f5d11041984f5845d2794299eaa3c2
Stable URL of this page
https://metraipolis.com/documento/dc_18143adc2fa5

How to cite

Protocol effects on feature-based hardware-Trojan detection across Trust-Hub families — arXiv:2609.07199 — arXiv (en), https://arxiv.org/abs/2609.07199 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_18143adc2fa5 (Metraipolis archive dc_18143adc2fa5, sha256 5e216559f4730aa2acdbe3eae9fe1570c8f5d11041984f5845d2794299eaa3c2)
BibTeX
@misc{dc18143adc2fa5,
  title = {Protocol effects on feature-based hardware-Trojan detection across Trust-Hub families — arXiv:2609.07199},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.07199},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_18143adc2fa5; sha256 5e216559f4730aa2acdbe3eae9fe1570c8f5d11041984f5845d2794299eaa3c2},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.07199. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Trust-Hub reuses host circuits: several files differ mainly in the inserted Trojan. When gates from sibling variants enter both training and test folds, a detector can benefit from host logic it has already seen. We measure that effect instead of proposing another classifier. The corpus contains 49,124 gates from 16 netlists grouped into five host families. We left the parser, 36 gate features, class weighting, model settings, threshold, and family-level aggregation unchanged and altered one choice: the test boundary. The three settings draw test gates from the pooled corpus, withhold a complete netlist, or withhold every variant of one host. The choice matters. Random forest records F1/AP of 0.914/0.978 with pooled gates, 0.636/0.851 with one netlist held out, and 0.460/0.577 with a host family held out. XGBoost falls from 0.946/0.976 to 0.464/0.544 across the same comparison. Logistic regression loses AP, although its fixed-threshold F1 is not monotonic. Each family shows the same pooled-to-family direction. Feature removal, repeated model and simulator seeds, score normalization, parser-related exclusions, and a smaller sample change the size of the gap without reversing it. Aggregation also matters: a gate-weighted average is dominated by the larger ISCAS files, so the headline values give each host family one vote. Bootstrap and jackknife summaries keep the gap positive, but their folds reuse training families. We treat the five family rows as descriptive evidence rather than independent trials. Five host families are too few for a population claim, and the experiment says nothing about transfer to a new cell library or an industrial design. It supports a narrower conclusion: sibling benchmark variants can inflate apparent transfer. Benchmarks with several variants of one host circuit should report family-aware holdouts and all five family results beside pooled scores.

Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-09-09 in cs.GT).
Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI); Computational Engineering, Finance, and Science (cs.CE); Databases (cs.DB); Computer Science and Game Theory (cs.GT).
Pagina del lavoro: https://arxiv.org/abs/2609.07199 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T13:06:09.197Z dalla pagina https://arxiv.org/catchup/cs.GT/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).