Threshold Implementations Are Not Provably Secure Against Fault Sensitivity Analysis
In an article presented at FDTC 2018, Arribas, De Cnudde, and Šijačić prove under mild conditions that threshold implementations (TIs) are secure against fault sensitivity analysis (FSA). Later in 2018, in the PhD thesis of De Cnudde, additional assumptions were imposed to provably withstand FSA, thereby increasing the required number of random bits. We point out that even under the latter, stronger conditions, the proof remains incorrect.