Secret sharing over infinite domains
暂无分享,去创建一个
[1] Patrick Billingsley,et al. Probability and Measure. , 1986 .
[2] Josh Benaloh,et al. Secret sharing homomorphisms: keeping shares of a secret secret , 1987, CRYPTO 1987.
[3] Adi Shamir,et al. How to share a secret , 1979, CACM.
[4] Douglas R. Stinson,et al. A Combinatorial Approach to Threshold Schemes , 1987, CRYPTO.
[5] Mitsuru Ito,et al. Secret sharing scheme realizing general access structure , 1989 .
[6] G. R. Blakley,et al. Security Proofs for Information Protection Systems , 1981, 1981 IEEE Symposium on Security and Privacy.
[7] P. Billingsley,et al. Probability and Measure , 1980 .
[8] Martín Abadi,et al. On hiding information from an oracle , 1987, J. Comput. Syst. Sci..
[9] G. R. BLAKLEY. Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[10] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[11] G. R. Blakley,et al. Infinite Structures in Information Theory , 1982, CRYPTO.
[12] Martín Abadi,et al. On hiding information from an oracle , 1987, STOC '87.
[13] Suresh C. Kothari,et al. Generalized Linear Threshold Scheme , 1985, CRYPTO.
[14] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[15] Josh Benaloh,et al. Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.
[16] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).