**2.8 Fuzzy vault**

It is an updated version of the ideas of the fuzzy commitment scheme [27]. In this scheme, a message *M* is encoded as coefficients of a k-degree polynomial (*p*) using Reed Solomon code RS, in *x* (data points evaluated on polynomial(*p*)) over a finite

**Figure 4.** *Model building.*

field *F*\_*q*. Then the polynomial p is evaluated at the input data points (*X*) to calculate *p* (*X*) = *Y*. These (*X*, *Y*) pairs, known as genuine points, constructing the locking set, which become the vault later. False points (called chaff) are used to hide the identity of the genuine points, and then, they are added to the genuine points set. This is called vault, which is then stored. The difficulty of the fuzzy vault scheme is shown in polynomial reconstruction problem, which is to make it secure [28].
