Secret sharing密钥分散

最新推荐文章于 2024-03-09 11:45:00 发布

转载最新推荐文章于 2024-03-09 11:45:00 发布 · 1k 阅读

文章标签：

#scheme #each #system

安全专栏收录该内容

38 篇文章

订阅专栏

本文介绍了一种将秘密分散给多个参与者的方法——秘密分享机制。通过该机制，只有当达到特定阈值数量的参与者聚集他们的份额时，才能重构出原始的秘密。文章还解释了(t,n)-阈值方案的概念，并提及该技术由Adi Shamir和George Blakley独立发明。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Secret sharing refers to method for distributing a secret amongst a group of participants, each of whom is allocated a share of the secret. The secret can be reconstructed only when a sufficient number of shares are combined together; individual shares are of no use on their own.

More formally, in a secret sharing scheme there is one dealer and n players . The dealer gives a secret to the players, but only when specific conditions are fulfilled. The dealer accomplishes this by giving each player a share in such a way that any group of t (for threshold ) or more players can together reconstruct the secret but no group of fewer than t players can. Such a system is called a (t, n) -threshold scheme (sometimes it is written as an (n, t) -threshold scheme).

Secret sharing was invented by both Adi Shamir and George Blakley , independent of each other, in 1979.

更详细的内容看wiki上的，

http://en.wikipedia.org/wiki/Secret_sharing#Secret_Sharing_using_the_Chinese_Remainder_Theorem