IEEE Transactions on Information Forensics and Security · 2018 · 24 citations · 23 references
ComputingComputer EngineeringComputer ScienceComputer SecurityCryptographyMachine LearningBlock CiphersCryptographic VulnerabilitiesFault DetectionFault DiagnosisSecurity AutomationBlock Cipher AnalysisBlock Cipher DesignCryptographic Fault AnalysisFault CharacterizationFault Detection Using Machine LearningFault-based AttacksMachine Learning For Fault DetectionMachine Learning-based Fault Diagnosis
Characterizing the fault space of a cipher to filter out a set of faults potentially exploitable for fault attacks (FA), is a problem with immense practical value. A quantitative knowledge of the exploitable fault space is desirable in several applications, such as security evaluation, cipher construction and implementation, design, testing of countermeasures, and so on. In this paper, we investigate this problem in the context of block ciphers. The formidable size of the fault space of a block cipher mandates the use of an automation strategy to solve this problem, which should be able to characterize each individual fault instance quickly. On the other hand, the automation strategy is expected to be applicable to most of the block cipher constructions. Existing techniques for automated fault attacks do not satisfy both of these goals simultaneously, and hence are not directly applicable in the context of exploitable fault characterization. In this paper, we present a supervised machine learning assisted automated framework, which successfully addresses both of the criteria mentioned. The key idea is to extrapolate the knowledge of some existing FAs on a cipher to rapidly figure out new attack instances. Experimental validation of this idea on two state-of-the-art block ciphers - PRESENT and LED - establishes that our approach is able to provide fairly good accuracy in identifying exploitable fault instances at a reasonable cost. Utilizing this observation, we propose a statistical framework for exploitable fault space characterization, which can provide an estimate of the success rate of an attacker corresponding to the given fault model and fault location. The framework also returns test vectors leading toward successful attacks. As a potential application, the effect of different S-Boxes on the fault space of a cipher is evaluated utilizing the framework.
23
Leo Breiman · Machine Learning · 2001 · 126.2K citations · Full text
SATzilla: Portfolio-based Algorithm Selection for SAT
Lizhong Xu, Frank Hutter, Holger H. Hoos et al. · Journal of Artificial Intelligence Research · 2008 · 835 citations · Full text
Algorithm runtime prediction: Methods & evaluation
Frank Hutter, Lin Xu, Holger H. Hoos et al. · Artificial Intelligence · 2013 · 384 citations
Fault Attacks on AES with Faulty Ciphertexts Only
Thomas Fuhr, Éliane Jaulmes, Victor Lomné et al. · 2013 · 165 citations