Towards the formal verification of security properties of a Network-on-Chip router
Authors:
- 1 May 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Abstract
Vulnerabilities and design flaws in Network-on-Chip (NoC) routers can be exploited in order to spy, modify and constraint the sensitive communication inside the Multi-Processors Systems-on-Chip (MPSoCs). Although previous works address the NoC threat, finding secure and efficient solutions to verify the security is still a challenge. In this work, we propose for the first time a method to formally verify the correctness and the security properties of a NoC router in order to provide the proper communication functionality and to avoid NoC attacks. We present a generalized verification flow that proves a wide set of implementation-independent security-related properties to hold. We employ unbounded model checking techniques to account for the highly-sequential behaviour of the NoC systems. The evaluation results demonstrate the feasibility of our approach by presenting verification results of six different NoC routing architectures demonstrating the vulnerabilities of each design.Keywords
This publication has 18 references indexed in Scilit:
- A Flexible Framework for the Automatic Generation of SBST ProgramsIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2016
- PHAETON: A SAT-Based Framework for Timing-Aware Path SensitizationIEEE Transactions on Computers, 2015
- NoC-Based Protection for SoC Time-Driven AttacksIEEE Embedded Systems Letters, 2014
- Networks on Chip with Provable Security PropertiesIEEE Micro, 2014
- SurfNoC2013
- Formal verification methodology considerations for network on chips2012
- Incremental preprocessing methods for use in BMCFormal Methods in System Design, 2011
- Symbolic model checking for sequential circuit verificationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1994
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theoryThe Journal of Symbolic Logic, 1957