Reusing Shares in Secret Sharing Schemes
暂无分享,去创建一个
[1] G. R. Blakley,et al. Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[2] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[3] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[4] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[5] Leonid A. Levin,et al. Pseudo-random generation from one-way functions , 1989, STOC '89.
[6] Roland Nehl. Robuste Shared Secret Schemes , 1993 .
[7] Josh Benaloh,et al. Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.
[8] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[9] Larry Carter,et al. New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..
[10] Mitsuru Ito,et al. Secret sharing scheme realizing general access structure , 1989 .
[11] Johan Håstad,et al. Pseudo-random generators under uniform assumptions , 1990, STOC '90.
[12] Adi Shamir,et al. How to share a secret , 1979, CACM.