Shamir's scheme

Shamir's scheme

1. They are cryptographic protocols to share a secret between a set of participants so that only when they join a number specified of participants it is possible to recover the secret.

   • In a scheme threshold), (k n there is a total of n participants and only having joined as minimum to k of them will be possible to recover the secret. We are going to describe later Shamir's scheme [6].

2. The algorithm bases his functioning on a property of the polynomials interpoladores and there was developed by the Israeli criptógrafo Adi Shamir, who presented it in 1979.

   • The essential idea of the combination of Shamir's threshold is that two points are sufficient to define a line, three points are to define a parable, four to define a cubic curve and so on. That is to say, points are necessary n+1 to define a polynomial of degree n.