How to share a secret

  • Adi Shamir
    Massachusetts Institute of Technology, Cambridge

抄録

<jats:p> In this paper we show how to divide data <jats:italic>D</jats:italic> into <jats:italic>n</jats:italic> pieces in such a way that <jats:italic>D</jats:italic> is easily reconstructable from any <jats:italic>k</jats:italic> pieces, but even complete knowledge of <jats:italic>k</jats:italic> - 1 pieces reveals absolutely no information about <jats:italic>D</jats: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 and security breaches expose all but one of the remaining pieces. </jats:p>

収録刊行物

被引用文献 (415)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ