Randomized byzantine generals
暂无分享,去创建一个
[1] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[2] Adi Shamir,et al. How to share a secret , 1979, CACM.
[3] Danny Dolev,et al. The Byzantine Generals Strike Again , 1981, J. Algorithms.
[4] Danny Dolev,et al. Polynomial algorithms for multiple processor agreement , 1982, STOC '82.
[5] Nancy A. Lynch,et al. A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..
[6] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[7] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[8] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[9] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.