Shamir's secret sharing (SSS) is an efficient secret sharing algorithm for distributing private information (the "secret") among a group so that the secret cannot be revealed unless a quorum of the group acts together to pool their knowledge. To achieve this, the secret is mathematically divided into parts (the "shares") from which the secret can be reassembled only when a sufficient number of shares are combined. SSS has the property of information-theoretic security, meaning that even if an attacker steals some shares, it is impossible for the attacker to reconstruct the secret unless they have stolen the quorum number of shares.
Shamir's secret sharing is used in some applications to share the access keys to a master secret.
SSS is used to secure a secret in a distributed form, most often to secure encryption keys. The secret is split into multiple shares, which individually do not give any information about the secret.
To reconstruct a secret secured by SSS, a number of shares is needed, called the threshold. No information about the secret can be gained from any number of shares below the threshold (a property called perfect secrecy). In this sense, SSS is a generalisation of the one-time pad (which can be viewed as SSS with a two-share threshold and two shares in total).
A company needs to secure their vault. If a single person knows the code to the vault, the code might be lost or unavailable when the vault needs to be opened. If there are several people who know the code, they may not trust each other to always act honestly.
SSS can be used in this situation to generate shares of the vault's code which are distributed to authorized individuals in the company. The minimum threshold and number of shares given to each individual can be selected such that the vault is accessible only by (groups of) authorized individuals. If fewer shares than the threshold are presented, the vault cannot be opened.
By accident or as an act of opposition, some individuals might present incorrect information for their shares. If the total of correct shares fails to meet the minimum threshold, the vault remains locked.
Shamir's secret sharing can be used to
- share a key for decrypting the root key of a password manager,
- recover a user key for encrypted email access and
- sharing of the passphrase used to recreate a master secret, which is in turn used to access a cryptocurrency wallet.
Properties and weaknesses
SSS has useful properties, but also weaknesses that mean that it is unsuited to some uses.
Useful properties include:
- Secure: The scheme has information-theoretic security.
- Minimal: The size of each piece does not exceed the size of the original data.
- Extensible: For any given threshold, shares can be dynamically added or deleted without affecting existing shares
- Dynamic: Security can be enhanced without changing the secret, but by changing the polynomial occasionally (keeping the same free term) and constructing a new share for each of the participants.
- Flexible: In organizations where hierarchy is important, each participant can be issued different numbers of shares according to their importance inside the organization. For instance, with a threshold of 3, the president could unlock the safe alone if given three shares, while three secretaries with one share each must combine their shares to unlock the safe.
- No verifiable secret sharing: During the share reassembly process, SSS does not provide a way to verify the correctness of each share being used. Verifiable secret sharing aims to verify that shareholders are honest and not submitting fake shares.
- Single point of failure: The secret must exist in one place when it is split into shares, and again in one place when it is reassembled. These are attack points, and other schemes including multisignature eliminate at least one of these single points of failure.
The scheme exploits the Lagrange interpolation theorem, specifically that points on the polynomial uniquely determines a polynomial of degree less than or equal to . For instance, 2 points are sufficient to define a line, 3 points are sufficient to define a parabola, 4 points to define a cubic curve and so forth.
Shamir's secret sharing is an ideal and perfect -threshold scheme based on polynomial interpolation over finite fields. In such a scheme, the aim is to divide a secret (for example, the combination to a safe) into pieces of data (known as shares) in such a way that:
- Knowledge of any or more shares makes computable. That is, the entire secret can be reconstructed from any combination of shares.
- Knowledge of any or fewer shares leaves completely undetermined, in the sense that the possible values for remain as likely with knowledge of up to shares as with knowledge of shares. The secret cannot be reconstructed with fewer than shares.
If , then all of the shares are needed to reconstruct the secret .
Assume that the secret can be represented as an element of a finite field (where is greater than the number of shares being generated). Randomly choose elements, , from and construct the polynomial . Compute any points out on the curve, for instance set to find points . Every participant is given a point (a non-zero input to the polynomial, and the corresponding output). Given any subset of of these pairs, can be obtained using interpolation, with one possible formula for doing so being , where the list of points on the polynomial is given as pairs of the form . Note that is equal to the first coefficient of polynomial .
The following example illustrates the basic idea. Note, however, that calculations in the example are done using integer arithmetic rather than using finite field arithmetic to make the idea easier to understand. Therefore, the example below does not provide perfect secrecy and is not a proper example of Shamir's scheme. The next example will explain the problem.
Suppose that the secret to be shared is 1234 .
In this example, the secret will be split into 6 shares , where any subset of 3 shares is sufficient to reconstruct the secret. numbers are taken at random. Let them be 166 and 94.
- This yields coefficients where is the secret
The polynomial to produce secret shares (points) is therefore:
Six points from the polynomial are constructed as:
Each participant in the scheme receives a different point (a pair of and ). Because is used instead of the points start from and not . This is necessary because is the secret.
In order to reconstruct the secret, any 3 points are sufficient
Consider using the 3 points.
Computing the Lagrange basis polynomials:
Using the formula for polynomial interpolation, is:
Recalling that the secret is the free coefficient, which means that , and the secret has been recovered.
Computationally efficient approach
Considering this, an optimized formula to use Lagrange polynomials to find is defined as follows:
Problem of using integer arithmetic
Although the simplified version of the method demonstrated above, which uses integer arithmetic rather than finite field arithmetic, works, there is a security problem: Eve gains information about with every that she finds.
Suppose that she finds the 2 points and . She still does not have points, so in theory she should not have gained any more information about . But she could combine the information from the 2 points with the public information: . Doing so, Eve could perform the following algebra:
- Fill the formula for with and the value of
- Fill (1) with the values of 's and
- Fill (1) with the values of 's and
- Subtract (3)-(2): and rewrite this as .
- Now, Eve can replace by (4) in (2): which leads her to the information that S is even.
Solution using finite field arithmetic
The above attack exploits constraints on the values that the polynomial may take by virtue of how it was constructed: the polynomial must have coefficients that are integers, and the polynomial must take an integer as value when evaluated at each of the coordinates used in the scheme. This reduces its possible values at unknown points, including the resultant secret, given fewer than shares.
This problem can be remedied by using finite field arithmetic. A finite field always has size , where is a prime and is a positive integer. The size of the field must satisfy , and that is greater than the number of possible values for the secret, though the latter condition may be circumvented by splitting the secret into smaller secret values, and applying the scheme to each of these. In our example below, we use a prime field (i.e. r = 1). The figure shows a polynomial curve over a finite field.
In practice this is only a small change. The order q of the field (i.e. the number of values that it has) must be chosen to be greater than the number of participants and the number of values that the secret may take. All calculations involving the polynomial must also be calculated over the field (mod p in our example, in which is taken to be a prime) instead of over the integers. Both the choice of the field and the mapping of the secret to a value in this field are considered to be publicly known.
For this example, choose , so the polynomial becomes which gives the points:
This time Eve doesn't gain any information when she finds a (until she has points).
Suppose again that Eve finds and , and the public information is: . Attempting the previous attack, Eve can:
- Fill the -formula with and the value of and :
- Fill (1) with the values of 's and
- Fill (1) with the values of 's and
- Subtract (3)-(2): and rewrite this as
There are possible values for . She knows that always decreases by 3, so if were divisible by she could conclude . However, is prime, so she can not conclude this. Thus, using a finite field avoids this possible attack.
Also, even though Eve can conclude that , it does not provide any additional information, since the "wrapping around" behavior of modular arithmetic prevents the leakage of "S is even", unlike the example with integer arithmetic above.
For purposes of keeping the code clearer, a prime field is used here. In practice, for convenience a scheme constructed using a smaller binary field may be separately applied to small substrings of bits of the secret (e.g. GF(256) for byte-wise application), without loss of security. The strict condition that the size of the field must be larger than the number of shares must still be respected (e.g., if the number of shares could exceed 255, the field GF(256) might be replaced by say GF(65536)).
""" The following Python implementation of Shamir's secret sharing is released into the Public Domain under the terms of CC0 and OWFa: https://creativecommons.org/publicdomain/zero/1.0/ http://www.openwebfoundation.org/legal/the-owf-1-0-agreements/owfa-1-0 See the bottom few lines for usage. Tested on Python 2 and 3. """ from __future__ import division from __future__ import print_function import random import functools # 12th Mersenne Prime _PRIME = 2 ** 127 - 1 _RINT = functools.partial(random.SystemRandom().randint, 0) def _eval_at(poly, x, prime): """Evaluates polynomial (coefficient tuple) at x, used to generate a shamir pool in make_random_shares below. """ accum = 0 for coeff in reversed(poly): accum *= x accum += coeff accum %= prime return accum def make_random_shares(secret, minimum, shares, prime=_PRIME): """ Generates a random shamir pool for a given secret, returns share points. """ if minimum > shares: raise ValueError("Pool secret would be irrecoverable.") poly = [secret] + [_RINT(prime - 1) for i in range(minimum - 1)] points = [(i, _eval_at(poly, i, prime)) for i in range(1, shares + 1)] return points def _extended_gcd(a, b): """ Division in integers modulus p means finding the inverse of the denominator modulo p and then multiplying the numerator by this inverse (Note: inverse of A is B such that A*B % p == 1). This can be computed via the extended Euclidean algorithm http://en.wikipedia.org/wiki/Modular_multiplicative_inverse#Computation """ x = 0 last_x = 1 y = 1 last_y = 0 while b != 0: quot = a // b a, b = b, a % b x, last_x = last_x - quot * x, x y, last_y = last_y - quot * y, y return last_x, last_y def _divmod(num, den, p): """Compute num / den modulo prime p To explain this, the result will be such that: den * _divmod(num, den, p) % p == num """ inv, _ = _extended_gcd(den, p) return num * inv def _lagrange_interpolate(x, x_s, y_s, p): """ Find the y-value for the given x, given n (x, y) points; k points will define a polynomial of up to kth order. """ k = len(x_s) assert k == len(set(x_s)), "points must be distinct" def PI(vals): # upper-case PI -- product of inputs accum = 1 for v in vals: accum *= v return accum nums =  # avoid inexact division dens =  for i in range(k): others = list(x_s) cur = others.pop(i) nums.append(PI(x - o for o in others)) dens.append(PI(cur - o for o in others)) den = PI(dens) num = sum([_divmod(nums[i] * den * y_s[i] % p, dens[i], p) for i in range(k)]) return (_divmod(num, den, p) + p) % p def recover_secret(shares, prime=_PRIME): """ Recover the secret from share points (points (x,y) on the polynomial). """ if len(shares) < 3: raise ValueError("need at least three shares") x_s, y_s = zip(*shares) return _lagrange_interpolate(0, x_s, y_s, prime) def main(): """Main function""" secret = 1234 shares = make_random_shares(secret, minimum=3, shares=6) print('Secret: ', secret) print('Shares:') if shares: for share in shares: print(' ', share) print('Secret recovered from minimum subset of shares: ', recover_secret(shares[:3])) print('Secret recovered from a different minimum subset of shares: ', recover_secret(shares[-3:])) if __name__ == '__main__': main()
- Secret sharing
- Secure multi-party computation
- Lagrange polynomial
- Homomorphic secret sharing – a simplistic decentralized voting protocol
- Two-man rule
- Partial Password
- "Seal/Unseal". Vault by HashiCorp. Retrieved 2022-10-02.
- "PreVeil Review". PCMag. Retrieved 2022-10-02.
- Rusnak, Pavol; Kozlik, Andrew; Vejpustek, Ondrej; Susanka, Tomas; Palatinus, Marek; Hoenicke, Jochen (2017-12-18). "SLIP-0039 : Shamir's Secret-Sharing for Mnemonic Codes". GitHub. SatoshiLabs. Retrieved 2022-10-03.
This SLIP describes a standard and interoperable implementation of Shamirs secret-sharing (SSS) and a specification for its use in backing up Hierarchical Deterministic Wallets described in BIP-0032.
- Lopp, Jameson (2020-10-01). "Shamir's Secret Sharing shortcomings". Retrieved 2022-10-03.
Variations of Shamir's Secret Sharing (SSS) have been implemented several times in the cryptocurrency space, only for developers to later realize that the additional complexity ended up reducing the security of the system.
- Shamir, Adi (1979), "How to share a secret", Communications of the ACM, 22 (11): 612–613, doi:10.1145/359168.359176, S2CID 16321225
- Knuth, D. E. (1997), The Art of Computer Programming, vol. II: Seminumerical Algorithms (3rd ed.), Addison-Wesley, p. 505.
- Dawson, E.; Donovan, D. (1994), "The breadth of Shamir's secret-sharing scheme", Computers & Security, 13: 69–78, doi:10.1016/0167-4048(94)90097-3.
- Benzekki, K. (2017), "A Verifiable Secret Sharing Approach for Secure MultiCloud Storage", In Ubiquitous Networking, Lecture Notes in Computer Science, Casablanca: Springer, 10542: 225–234, doi:10.1007/978-3-319-68179-5_20, ISBN 978-3-319-68178-8.