Abstract
This chapter introduces a method aiming to mute or detect hardware Trojan collusion in a multiprocessor system-on-chip (MPSoC). Hardware Trojans—malicious hardware modifications—in untrusted third-party IP (3PIP) processors may collude with each other, causing system-wide catastrophe. To prevent this, the method described in this chapter integrates “design-for-trust” (DfT) and “runtime monitoring”. First of all, the threat model of hardware Trojan collusion in MPSoCs will be given. Then, the motivation of utilizing IP vendor diversity as one of the DfT techniques will be discussed, followed by another DfT technique—security-aware task scheduling with a set of new security rules. An Integer Linear Programming (ILP) model and two heuristics are presented to ensure that the introduced security constraints can be fulfilled with minimum impact on other design goals, such as performance and hardware cost. As only communication channels between different vendors are considered “safe” and used to convey authorized inter-task communications, at runtime, unauthorized communications will either be muted if they are on a safe channel, or be detected if they are on an unsafe channel. The chapter concludes with experimental results that evaluate the effectiveness and efficiency of the proposed security enhancement.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
It is assumed that the scheduling is non-preemptive, that is, a task in execution cannot be preempted by any other task.
- 2.
This assumption can be easily extended to model different cores from one vendor.
- 3.
Graph coloring [8] is the problem of finding the minimum number of colors that ensure adjacent vertices in a graph do not share the same color.
- 4.
The definitions of V , C, and E hold for the remaining algorithms as well.
- 5.
The maximum clique of a graph is its largest complete subgraph . A graph with a maximum clique size of k needs at least k colors to color it.
- 6.
If no edge is added, the maximum clique size does not change.
- 7.
In MSI, each cache block can have one of three possible states: Modified, Shared, and Invalid. More details about the protocol can be found in [13].
References
Karri, R., Rajendran, J., Rosenfeld, K., Tehranipoor, M.: Trustworthy hardware: identifying and classifying hardware Trojans. Computer 43(10), 39–46 (2010)
Tehranipoor, M., Salmani, H., Zhang, X., Wang, X., Karri, R., Rajendran, J., Rosenfeld, K.: Trustworthy hardware: Trojan detection and design-for-trust challenges. IEEE Computer 44(7), 66–74 (2011)
Waksman, A., Suozzo, M., Sethumadhavan, S.: FANCI: identification of stealthy malicious logic using Boolean functional analysis. In: 2013 ACM SIGSAC Conference on Computer & Communications Security (CCS), pp. 697–708 (2013)
Orsila, H., Kangas, T., Hamalainen, T.D.: Hybrid algorithm for mapping static task graphs on multiprocessor SoCs. In: 2005 International Symposium on System-on-Chip (SOCC), pp. 146–150 (2005)
Schranzhofer, A., Chen, J.J., Thiele, L.: Dynamic power-aware mapping of applications onto heterogeneous MPSoC platforms. IEEE Trans. Ind. Inf. 6, 692–707 (2010)
Foutris, N., Gizopoulos, D., Psarakis, M., Vera, X., Gonzalez, A.: Accelerating microprocessor silicon validation by exposing ISA diversity. In: 44th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO), pp. 386–397 (2011)
Gizopoulos, D., Psarakis, M., Adve, S., Ramachandran, P., Hari, S., Sorin, D., Meixner, A., Biswas, A., Vera, X.: Architectures for online error detection and recovery in multicore processors. In: 2011 Design, Automation Test in Europe Conference Exhibition (DATE), pp. 533–538 (2011)
Brelaz, D.: New methods to color the vertices of a graph. Commun. ACM 22, 251–256 (1979)
Lingo. http://www.lindo.com
Kwok, Y.K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput. Surv. 31, 406–471 (1999)
Rădulescu, A., van Gemund, J.C.A.: On the complexity of list scheduling algorithms for distributed-memory systems. In: Proceedings of the 13th International Conference on Supercomputing (ICS), pp. 68–75 (1999)
Kim, K.: A method for computing upper bounds on the size of a maximum clique. Commun. Korean Math. Soc. 18, 745–754 (2003)
Culler, D.E., Singh, J.P., Gupta, A.: Parallel Computer Architecture: A Hardware/Software Approach. Morgan Kaufmann, San Francisco (1999)
Dick, R.P., Rhodes, D.L., Wolf, W.: TGFF: task graphs for free. In: Workshop on Hardware/Software Codesign (CODES), pp. 97–101 (1998)
Maheswaran, M., Ali, S., Siegel, H.J., Hensgen, D., Freund, R.F.: Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems. In: 8th Heterogeneous Computing Workshop (HCW), pp. 30–44 (1999)
Sih, G.C., Lee, E.A.: A Compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans. Parall. Distrib. Syst. 4, 175–187 (1993)
Wang, N., Yao, M., Jiang, D., Chen, S., Zhu, Y.: Security-driven task scheduling for multiprocessor system-on-chips with performance constraints. In: 2018 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), pp. 545–550 (2018)
Wang, N., Chen, S., Ni, J., Ling, X., Zhu, Y.: Security-aware task scheduling using untrusted components in high-level synthesis. IEEE Access 6, 15663–15678 (2018)
Sun, Y., Jiang, G., Lam, S., Ning, F.: Designing energy-efficient MPSoC with untrustworthy 3PIP cores. IEEE Trans. Parall. Distrib. Syst. 31(1), 51–63 (2020)
Ancajas, D.M., Chakraborty, K., Roy, S.: Fort-NoCs: mitigating the threat of a compromised NoC. In: 2014 51st ACM/EDAC/IEEE Design Automation Conference (DAC), pp. 1–6 (2014)
JYV, M.K., Swain, A.K., Kumar, S., Sahoo, S.R., Mahapatra, K.: Run time mitigation of performance degradation hardware Trojan attacks in network on chip. In: 2018 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), pp. 738–743 (2018)
Boraten, T., Kodi, A.K.: Mitigation of denial of service attack with hardware Trojans in NoC architectures. In: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1091–1100 (2016)
Daoud, L., Rafla, N.: Routing aware and runtime detection for infected network-on-chip routers. In: 2018 IEEE 61st International Midwest Symposium on Circuits and Systems (MWSCAS), pp. 775–778 (2018)
Orlin, J.B.: Integer Programming. http://web.mit.edu/15.053/www/AMP-Chapter-09.pdf
Culberson, J.: Graph Coloring Page. https://webdocs.cs.ualberta.ca/~joe/Coloring/index.html
Solihin, Y.: Fundamentals of Parallel Multicore Architecture, 1st edn. Chapman & Hall/CRC, Boca Raton (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Liu, C., Yang, C. (2022). Defense Against Hardware Trojan Collusion in MPSoCs. In: Katkoori, S., Islam, S.A. (eds) Behavioral Synthesis for Hardware Security. Springer, Cham. https://doi.org/10.1007/978-3-030-78841-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-78841-4_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-78840-7
Online ISBN: 978-3-030-78841-4
eBook Packages: Computer ScienceComputer Science (R0)