Visible to the public Biblio

Filters: Keyword is general framework  [Clear All Filters]
2018-04-11
Shen, G., Tang, Y., Li, S., Chen, J., Yang, B..  2017.  A General Framework of Hardware Trojan Detection: Two-Level Temperature Difference Based Thermal Map Analysis. 2017 11th IEEE International Conference on Anti-Counterfeiting, Security, and Identification (ASID). :172–178.

With the globalization of integrated circuit design and manufacturing, Hardware Trojan have posed serious threats to the security of commercial chips. In this paper, we propose the framework of two-level temperature difference based thermal map analysis detection method. In our proposed method, thermal maps of an operating chip during a period are captured, and they are differentiated with the thermal maps of a golden model. Then every pixel's differential temperature of differential thermal maps is extracted and compared with other pixel's. To mitigate the Gaussian white noise and to differentiate the information of Hardware Trojan from the information of normal circuits, Kalman filter algorithm is involved. In our experiment, FPGAs configured with equivalent circuits are utilized to simulate the real chips to validate our proposed approach. The experimental result reveals that our proposed framework can detect Hardware Trojan whose power proportion magnitude is 10''3.

2015-05-04
Moussallam, M., Daudet, L..  2014.  A general framework for dictionary based audio fingerprinting. Acoustics, Speech and Signal Processing (ICASSP), 2014 IEEE International Conference on. :3077-3081.

Fingerprint-based Audio recognition system must address concurrent objectives. Indeed, fingerprints must be both robust to distortions and discriminative while their dimension must remain to allow fast comparison. This paper proposes to restate these objectives as a penalized sparse representation problem. On top of this dictionary-based approach, we propose a structured sparsity model in the form of a probabilistic distribution for the sparse support. A practical suboptimal greedy algorithm is then presented and evaluated on robustness and recognition tasks. We show that some existing methods can be seen as particular cases of this algorithm and that the general framework allows to reach other points of a Pareto-like continuum.