Multifactor Authentication
4. Enabling Flexible MFA Operation
4.1. Conventional Approach
One of the approaches considered within the scope of this work is based on utilizing Lagrange polynomials for secret sharing. The system secret S is usually "split" and distributed among a set of key holders. It could be recovered later on, as described in and numerous other works, aswhere are the generated polynomial indexes and
is a unique identification factor
. In such systems, every key holder with a factor ID obtains its own unique key share
In conventional systems, it is required to collect any shares
of the initial secret to unlock the system, while the curve may offer
points, as it is shown in Figure 5. The
basic principle behind this approach is to specify the secret
and use the generated curve based on the random coefficients
to produce the secret shares
. This methodology is successfully utilized in many secret sharing systems
that employ the Lagrange interpolation formula.
Figure 5. Lagrange secret sharing scheme.
Unfortunately, this approach may not be applied for the MFA scenario directly, since the biometric parameters are already in place, i. e ., we can neither assign a new