ADVERSARIAL: And-Inverter Graph-Assisted Hardware Trojan Detection At Scale

• URL: http://arxiv.org/abs/2607.23882v1
• Date: Sun, 26 Jul 2026 23:00:09 GMT
• Title: ADVERSARIAL: And-Inverter Graph-Assisted Hardware Trojan Detection At Scale
• Abstract summary: The proposed approach incorporates symbolically enabled learning by modeling flattened gate-level netlists as And-Inverter Graphs (AIGs)<n>Each directed connection is expressed as a triple within a Knowledge Graph Embedding (KGE) framework, producing compact, constant-size per-node representations.<n>The AIG's bounded fan-in and uniform semantics ensure training and inference complexity scale linearly with edge count.
• Score: 1.1772291323400081
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Modern System-on-Chip (SoCs) often contain hundreds of millions to tens of billions of gates, making existing Hardware Trojan (HT) detection methods impractical due to their immense scale. The proposed approach incorporates symbolically enabled learning by modeling flattened gate-level netlists as Boolean networks represented as And-Inverter Graphs (AIGs), where all internal nodes are 2-input AND gates and inversions reside on the edges. Each directed connection is expressed as a triple within a Knowledge Graph Embedding (KGE) framework, producing compact, constant-size per-node representations that retain multi-hop structural context. The AIG's bounded fan-in and uniform semantics ensure training and inference complexity scale linearly with edge count, addressing major scalability bottlenecks in HT detection. Symbolically enabled learning across deep datapaths enables the model to differentiate circuit structures from rare and functionally inconsistent connections that signify potential Trojan triggers and payloads. Experiments on large-scale SoC benchmarks demonstrate clear geometric separation between Trojan and benign nodes and practical scalability.

Related papers

• Beyond Flat Netlist: Hierarchical Graph Representation Learning for Scalable Analysis of Sequential Circuits [15.582237623722392]
  We introduce DeepSeq3, a novel hierarchical framework that abstracts circuits into a two-level representation.<n>A dual Graph Neural Network (GNN) architecture learns representations at both levels.<n>A state-centric pre-training scheme predicts the reachability between FF states, endowing the model with a deep understanding of temporal behavior.
  arXiv  Detail & Related papers  (2026-08-28T10:56:04Z)
• LoRC: Detecting AI-Generated Images via Low-Rank Collapse in Semantic Residuals [50.157719466558696]
  We show that modern generators exhibit low-rank collapse in the semantic-residual subspace while preserving the dominant semantic direction.<n>We propose textbfLoRC, a framework that decouples semantic dominance to capture the collapsed residual geometry.<n>Our method improves accuracy by an average of 7.0% across multiple benchmarks and achieves 97.0% accuracy on 39 unseen generators.
  arXiv  Detail & Related papers  (2026-08-21T08:58:47Z)
• Machine Learning-Based Reconstruction for Resistive Silicon Sensors [53.365453214937496]
  We study machine-learning-based reconstruction and compression for resistive silicon sensors.<n>We use full-waveform information from correlated pads to regularise the reconstruction and extract spatial information.<n>We first introduce recurrent neural network models based on LSTM layers, which provide a proof-of-concept implementation for full-waveform reconstruction.
  arXiv  Detail & Related papers  (2026-07-13T14:03:26Z)
• Beyond Pixels: Vector-to-Graph Transformation for Reliable Schematic Auditing [34.54168175788343]
  We propose a Vector-to-Graph (V2G) pipeline that converts CAD diagrams into property graphs where nodes represent components and edges encode connectivity.<n>On a diagnostic benchmark of electrical compliance checks, V2G yields large accuracy gains across all error categories, while leading MLLMs remain near chance level.
  arXiv  Detail & Related papers  (2026-02-12T07:50:49Z)
• Interpreting Manifolds and Graph Neural Embeddings from Internet of Things Traffic Flows [1.8510825807956957]
  This work introduces an interpretable pipeline that generates directly visualizable low-dimensional representations by mapping high-dimensional embeddings onto a latent manifold.<n>The framework achieves a classification F1-score of 0.830 for intrusion detection while also highlighting phenomena such as concept drift.
  arXiv  Detail & Related papers  (2026-02-05T16:08:24Z)
• TransBridge: Boost 3D Object Detection by Scene-Level Completion with Transformer Decoder [66.22997415145467]
  This paper presents a joint completion and detection framework that improves the detection feature in sparse areas.<n> Specifically, we propose TransBridge, a novel transformer-based up-sampling block that fuses the features from the detection and completion networks.<n>The results show that our framework consistently improves end-to-end 3D object detection, with the mean average precision (mAP) ranging from 0.7 to 1.5 across multiple methods.
  arXiv  Detail & Related papers  (2025-12-12T00:08:03Z)
• Automated Hardware Trojan Insertion in Industrial-Scale Designs [1.1772291323400081]
  This work presents an automated and scalable methodology for generating HT-like patterns in industry-scale netlists.<n>The pipeline parses large gate-level designs into connectivity graphs, and explores rare regions using SCOAP testability metrics.<n>When evaluated on the benchmarks generated in this work, representative state-of-the-art graph-learning models fail to detect Trojans.
  arXiv  Detail & Related papers  (2025-11-11T19:08:31Z)
• T-GAE: Transferable Graph Autoencoder for Network Alignment [79.89704126746204]
  T-GAE is a graph autoencoder framework that leverages transferability and stability of GNNs to achieve efficient network alignment without retraining. Our experiments demonstrate that T-GAE outperforms the state-of-the-art optimization method and the best GNN approach by up to 38.7% and 50.8%, respectively.
  arXiv  Detail & Related papers  (2023-10-05T02:58:29Z)
• Golden Reference-Free Hardware Trojan Localization using Graph Convolutional Network [13.789604831994364]
  Hardware Trojans (HTs) can compromise the integrity, deteriorate the performance, deny the service, and alter the functionality of the design. We propose a novel, golden reference-free HT localization method at the pre-silicon stage by leveraging Graph Convolutional Network (GCN) It locates the Trojan signals with 99.6% accuracy, 93.1% F1-score, and a false-positive rate below 0.009%.
  arXiv  Detail & Related papers  (2022-07-14T05:27:16Z)
• Dynamic Graph: Learning Instance-aware Connectivity for Neural Networks [78.65792427542672]
  Dynamic Graph Network (DG-Net) is a complete directed acyclic graph, where the nodes represent convolutional blocks and the edges represent connection paths. Instead of using the same path of the network, DG-Net aggregates features dynamically in each node, which allows the network to have more representation ability.
  arXiv  Detail & Related papers  (2020-10-02T16:50:26Z)
• Suppress and Balance: A Simple Gated Network for Salient Object Detection [89.88222217065858]
  We propose a simple gated network (GateNet) to solve both issues at once. With the help of multilevel gate units, the valuable context information from the encoder can be optimally transmitted to the decoder. In addition, we adopt the atrous spatial pyramid pooling based on the proposed "Fold" operation (Fold-ASPP) to accurately localize salient objects of various scales.
  arXiv  Detail & Related papers  (2020-07-16T02:00:53Z)
• Binary DAD-Net: Binarized Driveable Area Detection Network for Autonomous Driving [94.40107679615618]
  This paper proposes a novel binarized driveable area detection network (binary DAD-Net) It uses only binary weights and activations in the encoder, the bottleneck, and the decoder part. It outperforms state-of-the-art semantic segmentation networks on public datasets.
  arXiv  Detail & Related papers  (2020-06-15T07:09:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.