Edge-Semantic Perceiver IO for Firmware Backdoor Detection Using Binary Function Call Graphs

Authors

  • Takács Ádám Faculty of Science and Informatics, University of Szeged, Szeged, 6720, Hungary
  • Juhász Imre Faculty of Science and Informatics, University of Szeged, Szeged, 6720, Hungary

DOI:

https://doi.org/10.64972/dea.2022.v1i2.4132d:16-30

Keywords:

Firmware Backdoor Detection, Binary Function Call Graph, Perceiver IO, Edge Semantics, Latent Attention, Cross-Architecture Generalization

Abstract

Firmware backdoors are difficult to detect after compilation because malicious behavior may be confined to a small set of functions and remain hidden after extensive changes to instruction layout. This paper proposes ESPI-FBD, an edge-semantic Perceiver IO framework that analyzes binary function call graphs while avoiding quadratic interaction among all recovered functions. The method integrates architecture-normalized function descriptors, typed directional call-relation biases, salience-seeded latent vectors, latent self-attention, and separate output queries for firmware classification and suspicious-function ranking. A product-disjoint evaluation protocol is specified for a multi-architecture firmware corpus and covers detection, localization, cross-architecture transfer, robustness, calibration, latency, and memory. The framework is designed to preserve sparse malicious evidence in a bounded latent workspace and to return an analyst-oriented review queue in addition to an image-level decision. The numerical values currently reported are illustrative placeholders that define the intended evaluation and must be replaced with audited experimental outputs before submission.

Downloads

Published

2022-06-14

How to Cite

Ádám, T., & Imre, J. (2022). Edge-Semantic Perceiver IO for Firmware Backdoor Detection Using Binary Function Call Graphs. Data Engineering and Applications, 1(2), 2d:16–30. https://doi.org/10.64972/dea.2022.v1i2.4132d:16-30

Issue

Section

Articles

Similar Articles

<< < 2 3 4 5 6 7 8 > >> 

You may also start an advanced similarity search for this article.