Optimal model search for hardware-trojan-based bit-level fault attacks on block ciphers

2018 ◽  
Vol 61 (3) ◽  
Author(s):  
Xinjie Zhao ◽  
Fan Zhang ◽  
Shize Guo ◽  
Zheng Gong
2017 ◽  
Vol 60 (4) ◽  
Author(s):  
Fan Zhang ◽  
Xinjie Zhao ◽  
Wei He ◽  
Shivam Bhasin ◽  
Shize Guo

10.29007/fmzl ◽  
2018 ◽  
Author(s):  
Sayandeep Saha ◽  
Ujjawal Kumar ◽  
Debdeep Mukhopadhyay ◽  
Pallab Dasgupta

Characterization of all possible faults in a cryptosystem exploitable for fault attacks is a problem which is of both theoretical and practical interest for the cryptographic community. The complete knowledge of exploitable fault space is desirable while designing optimal countermeasures for any given crypto-implementation. In this paper, we address the exploitable fault characterization problem in the context of Differential Fault Analysis (DFA) attacks on block ciphers. The formidable size of the fault spaces demands an automated albeit fast mechanism for verifying each individual fault instance and neither thetraditional, cipher-specific, manual DFA techniques nor the generic and automated Algebraic Fault Attacks (AFA) [10] fulfill these criteria. Further, the diversified structures of different block ciphers suggest that such an automation should be equally applicable to any block cipher. This work presents an automatedframework for DFA identification, fulfilling all aforementioned criteria, which, instead of performing the attack just estimates the attack complexity for each individual fault instance. A generic and extendable data-mining assisted dynamic analysis framework capable of capturing a large class of DFA distinguishersis devised, along with a graph-based complexity analysis scheme. The framework significantly outperforms another recently proposed one [6], in terms of attack class coverage and automation effort. Experimental evaluation on AES and PRESENT establishes the effectiveness of the proposed framework in detectingmost of the known DFAs, which eventually enables the characterization of the exploitable fault space.


2016 ◽  
Vol 11 (5) ◽  
pp. 1039-1054 ◽  
Author(s):  
Fan Zhang ◽  
Shize Guo ◽  
Xinjie Zhao ◽  
Tao Wang ◽  
Jian Yang ◽  
...  

Author(s):  
Souma Chowdhury ◽  
Ali Mehmani ◽  
Achille Messac

One of the primary drawbacks plaguing wider acceptance of surrogate models is their low fidelity in general. This issue can be in a large part attributed to the lack of automated model selection techniques, particularly ones that do not make limiting assumptions regarding the choice of model types and kernel types. A novel model selection technique was recently developed to perform optimal model search concurrently at three levels: (i) optimal model type (e.g., RBF), (ii) optimal kernel type (e.g., multiquadric), and (iii) optimal values of hyper-parameters (e.g., shape parameter) that are conventionally kept constant. The error measures to be minimized in this optimal model selection process are determined by the Predictive Estimation of Model Fidelity (PEMF) method, which has been shown to be significantly more accurate than typical cross-validation-based error metrics. In this paper, we make the following important advancements to the PEMF-based model selection framework, now called the Concurrent Surrogate Model Selection or COSMOS framework: (i) The optimization formulation is modified through binary coding to allow surrogates with differing numbers of candidate kernels and kernels with differing numbers of hyper-parameters (which was previously not allowed). (ii) A robustness criterion, based on the variance of errors, is added to the existing criteria for model selection. (iii) A larger candidate pool of 16 surrogate-kernel combinations is considered for selection — possibly making COSMOS one of the most comprehensive surrogate model selection framework (in theory and implementation) currently available. The effectiveness of the COSMOS framework is demonstrated by successfully applying it to four benchmark problems (with 2–30 variables) and an airfoil design problem. The optimal model selection results illustrate how diverse models provide important tradeoffs for different problems.


Author(s):  
Fan Zhang ◽  
Xiaoxuan Lou ◽  
Xinjie Zhao ◽  
Shivam Bhasin ◽  
Wei He ◽  
...  

Persistence is an intrinsic nature for many errors yet has not been caught enough attractions for years. In this paper, the feature of persistence is applied to fault attacks, and the persistent fault attack is proposed. Different from traditional fault attacks, adversaries can prepare the fault injection stage before the encryption stage, which relaxes the constraint of the tight-coupled time synchronization. The persistent fault analysis (PFA) is elaborated on different implementations of AES-128, specially fault hardened implementations based on Dual Modular Redundancy (DMR). Our experimental results show that PFA is quite simple and efficient in breaking these typical implementations. To show the feasibility and practicability of our attack, a case study is illustrated on the shared library Libgcrypt with rowhammer technique. Approximately 8200 ciphertexts are enough to extract the master key of AES-128 when PFA is applied to Libgcrypt1.6.3 with redundant encryption based DMR. This work puts forward a new direction of fault attacks and can be extended to attack other implementations under more interesting scenarios.


2017 ◽  
Vol 12 (2) ◽  
pp. 309-322 ◽  
Author(s):  
Bo Wang ◽  
Leibo Liu ◽  
Chenchen Deng ◽  
Min Zhu ◽  
Shouyi Yin ◽  
...  

2020 ◽  
Vol 644 ◽  
pp. A37
Author(s):  
M. Farnir ◽  
M.-A. Dupret ◽  
G. Buldgen ◽  
S. J. A. J. Salmon ◽  
A. Noels ◽  
...  

Context. Being part of the brightest solar-like stars, and close solar analogues, the 16 Cygni system is of great interest to the scientific community and may provide insight into the past and future evolution of our Sun. It has been observed thoroughly by the Kepler satellite, which provided us with data of an unprecedented quality. Aims. This paper is the first of a series aiming to extensively characterise the system. We test several choices of micro- and macro-physics to highlight their effects on optimal stellar parameters and provide realistic stellar parameter ranges. Methods. We used a recently developed method, WhoSGlAd, that takes the utmost advantage of the whole oscillation spectrum of solar-like stars by simultaneously adjusting the acoustic glitches and the smoothly varying trend. For each choice of input physics, we computed models which account, at best, for a set of seismic indicators that are representative of the stellar structure and are as uncorrelated as possible. The search for optimal models was carried out through a Levenberg-Marquardt minimisation. First, we found individual optimal models for both stars. We then selected the best candidates to fit both stars while imposing a common age and composition. Results. We computed realistic ranges of stellar parameters for individual stars. We also provide two models of the system regarded as a whole. We were not able to build binary models with the whole set of choices of input physics considered for individual stars as our constraints seem too stringent. We may need to include additional parameters to the optimal model search or invoke non-standard physical processes.


2018 ◽  
Author(s):  
Clive J. Hoggart

AbstractThere is increasing interest in developing point of care tests to diagnose disease and predict prognosis based upon biomarker signatures of RNA or protein expression levels. Technology to measure the required biomarkers accurately and in a time-frame useful to health care professionals will be easier to develop by minimising the number of biomarkers measured. In this paper we describe the Parallel Regularised Regression Model Search (PReMS) method which is designed to estimate parsimonious prediction models. Given a set of potential biomarkers PReMS searches over many logistic regression models constructed from optimal subsets of the biomarkers, iteratively increasing the model size. Zero centred Gaussian prior distributions are assigned to all regression coefficients to induce shrinkage. The method estimates the optimal shrinkage parameter, optimal model for each model size and the optimal model size. We apply PReMS to six freely available data sets and compare its performance with the LASSO and SCAD algorithms in terms of the number of covariates in the model, model accuracy, as measured by the area under the receiver operator curve (AUC) and root predicted mean square error, and model calibration. We show that PReMS typically selects models with fewer biomarkers than both the LASSO and SCAD algorithms but has comparable predictive accuracy.Availability: (PReMS) is freely available as an R package https://github.com/clivehoggart/PReMS


Sign in / Sign up

Export Citation Format

Share Document