MULTI-FACTOR AUTHENTICATION MODELLING

Abstract
Context. Currently, institutions and companies face massive cyber-attacks. Attacks are always focused on some authentication weakness that is part of a particular authentication protocol. In the event of an attack, it is necessary to respond flexibly to the weakening of authentication mechanisms. In the event of an attack, it is necessary to quickly identify the affected authentication factor and its importance to temporarily weaken. Subsequently, it is possible to detect the affected weakness and weaken the meaning of only the algorithms showing this weakness. Algorithms that do not show this weakness should be left unchanged. This paper introduces a mathematics model of authentication. By quick changing the model parameters, we can flexibly adapt the use of authentication means to the situation. Objective. The purpose of this work is to propose a method that will allow to quantify the strength (quality) of authentication. In order it will be possible to dynamically change the authentication method depending on the current risks of attacks. Method. The method is to design a mathematical model and its simulation. The model is then based on the sum of the strengths of the individual authentication factors. A risk-based mechanism is used to determine model parameters. Results. The paper then demonstrates the simulation results using commonly used authentication means. The paper then demonstrates the simulation results using commonly used authentication means: password, hardware based one-time password, device fingerprint, external authentication, and combination of this methods. Simulations have shown that using this mathematical model makes it easy to model the use of authentication resources. Conclusions. With this model, it seems easy to model different security situations. In the real situation, the model parameters will need to be refined as part of the feedback assessment of the established security incidents.

This publication has 5 references indexed in Scilit: