{"title":"3D Integration: Another Dimension Toward Hardware Security","authors":"J. Knechtel, Satwik Patnaik, O. Sinanoglu","doi":"10.1109/IOLTS.2019.8854395","DOIUrl":"https://doi.org/10.1109/IOLTS.2019.8854395","url":null,"abstract":"We review threats and selected schemes concerning hardware security at design and manufacturing time as well as at runtime. We find that 3D integration can serve well to enhance the resilience of different hardware security schemes, but it also requires thoughtful use of the options provided by the umbrella term of 3D integration. Toward enforcing security at runtime, we envision secure 2.5D system-level integration of untrusted chips and “all around” shielding for 3D ICs.","PeriodicalId":383056,"journal":{"name":"2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design (IOLTS)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123510362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Efficient SAT-Attack Algorithm Against Logic Encryption","authors":"Y. Matsunaga, Masayoshi Yoshimura","doi":"10.1109/IOLTS.2019.8854466","DOIUrl":"https://doi.org/10.1109/IOLTS.2019.8854466","url":null,"abstract":"This paper presents a novel efficient SAT-attack algorithm for logic encryption. The existing SAT-attack algorithm can decrypt almost all encrypted circuits proposed so far, however, there are cases that it takes a huge amount of CPU time. This is because the number of clauses being added during the decryption increases drastically in that case. To overcome that problem, a novel algorithm is developed, which considers the equivalence of clauses to be added. Experiments show that the proposed algorithm is much faster than the existing algorithm.","PeriodicalId":383056,"journal":{"name":"2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design (IOLTS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133265394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hassan Ali, Hammad Tariq, Muhammad Abdullah Hanif, Faiq Khalid, Semeen Rehman, Rehan Ahmed, M. Shafique
{"title":"QuSecNets: Quantization-based Defense Mechanism for Securing Deep Neural Network against Adversarial Attacks","authors":"Hassan Ali, Hammad Tariq, Muhammad Abdullah Hanif, Faiq Khalid, Semeen Rehman, Rehan Ahmed, M. Shafique","doi":"10.1109/IOLTS.2019.8854377","DOIUrl":"https://doi.org/10.1109/IOLTS.2019.8854377","url":null,"abstract":"Adversarial examples have emerged as a significant threat to machine learning algorithms, especially to the convolutional neural networks (CNNs). In this paper, we propose two quantization-based defense mechanisms, Constant Quantization (CQ) and Trainable Quantization (TQ), to increase the robustness of CNNs against adversarial examples. CQ quantizes input pixel intensities based on a “fixed” number of quantization levels, while in TQ, the quantization levels are “iteratively learned during the training phase”, thereby providing a stronger defense mechanism. We apply the proposed techniques on undefended CNNs against different state-of-the-art adversarial attacks from the open-source Cleverhans library. The experimental results demonstrate 50%–96% and 10%–50% increase in the classification accuracy of the perturbed images generated from the MNIST and the CIFAR-10 datasets, respectively, on commonly used CNN (Conv2D(64, 8×8)-Conv2D(128, 6×6)-Conv2D(128, 5×5) - Dense(10) - Softmax()) available in Cleverhans library.","PeriodicalId":383056,"journal":{"name":"2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design (IOLTS)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114155057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Faiq Khalid, Muhammad Abdullah Hanif, Semeen Rehman, Rehan Ahmed, M. Shafique
{"title":"TrISec: Training Data-Unaware Imperceptible Security Attacks on Deep Neural Networks","authors":"Faiq Khalid, Muhammad Abdullah Hanif, Semeen Rehman, Rehan Ahmed, M. Shafique","doi":"10.1109/IOLTS.2019.8854425","DOIUrl":"https://doi.org/10.1109/IOLTS.2019.8854425","url":null,"abstract":"Most of the data manipulation attacks on deep neural networks (DNNs) during the training stage introduce a perceptible noise that can be catered by preprocessing during inference, or can be identified during the validation phase. There-fore, data poisoning attacks during inference (e.g., adversarial attacks) are becoming more popular. However, many of them do not consider the imperceptibility factor in their optimization algorithms, and can be detected by correlation and structural similarity analysis, or noticeable (e.g., by humans) in multi-level security system. Moreover, majority of the inference attack rely on some knowledge about the training dataset. In this paper, we propose a novel methodology which automatically generates imperceptible attack images by using the back-propagation algorithm on pre-trained DNNs, without requiring any information about the training dataset (i.e., completely training data-unaware). We present a case study on traffic sign detection using the VGGNet trained on the German Traffic Sign Recognition Benchmarks dataset in an autonomous driving use case. Our results demonstrate that the generated attack images successfully perform misclassification while remaining imperceptible in both “subjective” and “objective” quality tests.","PeriodicalId":383056,"journal":{"name":"2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design (IOLTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129505662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Vulnerability Factor for ECC-protected Memory","authors":"Luc Jaulmes, Miquel Moretó, M. Valero, Marc Casas","doi":"10.1109/IOLTS.2019.8854397","DOIUrl":"https://doi.org/10.1109/IOLTS.2019.8854397","url":null,"abstract":"Fault injection studies and vulnerability analyses have been used to estimate the reliability of data structures in memory. We survey these metrics and look at their adequacy to describe the data stored in ECC-protected memory. We also introduce FEA, a new metric improving on the memory derating factor by ignoring a class of false errors. We measure all metrics using simulations and compare them to the outcomes of injecting errors in real runs. This in-depth study reveals that FEA provides more accurate results than any state-of-the-art vulnerability metric. Furthermore, FEA gives an upper bound on the failure probability due to an error in memory, making this metric a tool of choice to quantify memory vulnerability. Finally, we show that ignoring these false errors reduces the failure rate on average by 12.75% and up to over 45%.","PeriodicalId":383056,"journal":{"name":"2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design (IOLTS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124366658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Test Generation Method Based on k-Cycle Testing for Finite State Machines","authors":"Yuya Kinoshita, Toshinori Hosokawa, H. Fujiwara","doi":"10.1109/IOLTS.2019.8854426","DOIUrl":"https://doi.org/10.1109/IOLTS.2019.8854426","url":null,"abstract":"Scan testing requires long test application time and a large hardware overhead. To avoid these disadvantages, design-for-testability methods at register transfer level based on non-scan testing are important. We assume that controllers and data paths in register transfer level circuits are isolated from each other at testing. We focus on test generation for controllers which are represented by finite state machines. In this paper, we propose a time expansion model with initial state constraints for controllers and its test generation method. Our proposed test generation method also uses the information of finite state machines. Experimental results show that our proposed method achieved higher fault coverage by 8.9% on average for all controllers compared with a commercial tool whose test generation algorithms use a time expansion model.","PeriodicalId":383056,"journal":{"name":"2019 IEEE 25th International Symposium on On-Line Testing and Robust System Design (IOLTS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125264781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}