Perfectly secure message transmission
暂无分享,去创建一个
Moti Yung | Danny Dolev | Cynthia Dwork | Orli Waarts | C. Dwork | D. Dolev | M. Yung | Orli Waarts
[1] R. J. McEliece,et al. On sharing secrets and Reed-Solomon codes , 1981, CACM.
[2] Daniel Lehmann,et al. On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem , 1981, POPL '81.
[3] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[4] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[5] Eli Upfal,et al. Fault Tolerance in Networks of Bounded Degree , 1988, SIAM J. Comput..
[6] Adi Shamir,et al. How to share a secret , 1979, CACM.
[7] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[8] Baruch Awerbuch,et al. Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[9] Silvio Micali,et al. Optimal algorithms for Byzantine agreement , 1988, STOC '88.
[10] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.