Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
发表信息
作者
- Torben Pryds Pedersen
笔记
It is shown how to distribute a secret to n persons such that each person can verify that he has received correct information about the secret without talking with other persons. Any k of these persons can later find the secret (1 ≤ k ≤ n), whereas fewer than k persons get no (Shannon) information about the secret. The information rate of the scheme is 1/2 and the distribution as well as the verification requires approximately 2k modular multiplications pr. bit of the secret. It is also shown how a number of persons can choose a secret “in the well” and distribute it verifiably among themselves.
本文介绍了一种将秘密分发给n个人的方法。每个人都能够在不与其他人交流的情况下验证自己获得的关于该秘密的信息是否正确。其中任意k个人可以后续重建该秘密(1 ≤ k ≤ n)，而少于k个人则无法获得关于该秘密的任何（香农）信息。该方案的信息率为1/2，分发过程和验证过程每比特秘密大约需要2k次模乘运算。文中还说明了如何让多个人能够”在井中”选择一个秘密并在彼此之间进行可验证的分发。