Skip to main content

​
How to Share a Secret

Adi Shamir’s paper introduces ‘Shamir’s Secret Sharing,’ a mathematical method for partitioning a secret into several pieces, such that the secret can only be r

​
Abstract

Adi Shamir’s paper introduces ‘Shamir’s Secret Sharing,’ a mathematical method for partitioning a secret into several pieces, such that the secret can only be reconstructed when a defined number (a threshold) of pieces are provided. This work has become a cornerstone of blockchain security, specifically in the context of multi-party computation (MPC), social recovery wallets, and distributed key management systems (DKMS). By avoiding a single point of failure for sensitive private keys, secret sharing allows for more resilient security architectures that align with the decentralized ethos of blockchain. The paper uses the theory of polynomial interpolation to demonstrate how to achieve this threshold-based access, offering a robust and elegant solution to the challenge of secret protection. In Web3, this methodology is now central to developing non-custodial solutions that offer institutional-grade security for individuals, ensuring that users have the power to retain control of their digital identity without the risk of single-point compromise. Authors: Adi Shamir Publication: Academic Paper Publication date: 1979-01-01

​
Key findings

  • Introduces a threshold-based method for secret distribution and recovery.
  • Demonstrates that a secret can be split without the need for a single, central holder.
  • Provides the mathematical basis for modern multi-party computation.
  • Enhances security for private keys in decentralized asset management.

​
Citation

Adi Shamir (1979). How to Share a Secret. Academic Paper. https://dl.acm.org/doi/10.1145/359168.359176
Canonical knowledge ID: research:how-to-share-a-secret