Verifiable secret sharing and achieving simultaneity in the presence of faults
暂无分享,去创建一个
Baruch Awerbuch | Silvio Micali | Shafi Goldwasser | Benny Chor | S. Micali | B. Chor | B. Awerbuch | S. Goldwasser
[1] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[2] Adi Shamir,et al. How to share a secret , 1979, CACM.
[3] Manuel Blum,et al. Coin Flipping by Telephone. , 1981, CRYPTO 1981.
[4] Justin M. Reyneri,et al. Coin flipping by telephone , 1984, IEEE Trans. Inf. Theory.
[5] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[6] Manuel Blum,et al. Coin flipping by telephone a protocol for solving impossible problems , 1983, SIGA.
[7] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[8] Oded Goldreich,et al. The Bit Security of Modular Squaring Given Partial Factorization of the Modulos , 1985, CRYPTO.
[9] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[10] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[11] Keith Jackson. Two issues in public key cryptography, RSA bit security and a new knapsack type system: Ben-Zion Chor, published by MIT Press, 1986. , 1987 .