How to share a secret

  title={How to share a secret},
  author={A. Shamir},
  journal={Commun. ACM},
  • A. Shamir
  • Published 1979
  • Computer Science
  • Commun. ACM
  • In this paper we show how to divide data <italic>D</italic> into <italic>n</italic> pieces in such a way that <italic>D</italic> is easily reconstructable from any <italic>k</italic> pieces, but even complete knowledge of <italic>k</italic> - 1 pieces reveals absolutely no information about <italic>D</italic>. This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces… CONTINUE READING

    Topics from this paper.

    Ciphertext-Policy Attribute-Based Encryption
    • 3,479
    • PDF
    Fuzzy Identity-Based Encryption
    • 3,511
    • PDF
    Threshold Cryptosystems
    • 1,091
    • PDF
    A practical scheme for non-interactive verifiable secret sharing
    • 1,022
    • PDF
    A Threshold Cryptosystem without a Trusted Party (Extended Abstract)
    • 759
    • PDF
    A Fuzzy Vault Scheme
    • 1,366
    • PDF
    A randomized protocol for signing contracts
    • 1,326
    • PDF