Secret sharing is a technique in cryptography for splitting a secret, such as a password or a private key, into several pieces called shares and handing them to different people or storing them in different places. In a threshold scheme, written "t-of-n", any t of the n shares can rebuild the secret, while any smaller number gives no useful information about it. A 3-of-5 setup, for example, survives the loss of two shares and resists the theft of two.
The best-known method is Shamir's Secret Sharing, published by Adi Shamir in 1979, which hides the secret in a polynomial. In crypto, secret sharing is used to back up a seed phrase across several locations and underpins many multi-party computation systems, in which key shares are used to sign without the full key ever being assembled. It differs from a multisig wallet, where several separate keys sign and the blockchain itself enforces the threshold.
Ref 1070001271