Optimally efficient multi-valued byzantine agreement
暂无分享,去创建一个
[1] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[2] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[3] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[4] Brian A. Coan,et al. Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement , 1984, Inf. Process. Lett..
[5] D. Dolev,et al. Bounds on information exchange for Byzantine agreement , 1985, JACM.
[6] Silvio Micali,et al. An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement , 1989, ICALP.
[7] David Chaum,et al. Unconditionally Secure Digital Signatures , 1990, CRYPTO.
[8] Brian A. Coan,et al. Modular Construction of a Byzantine Agreement Protocol with Optimal Message Bit Complexity , 1992, Inf. Comput..
[9] Piotr Berman,et al. Bit optimal distributed consensus , 1992 .
[10] Birgit Pfitzmann,et al. Information-Theoretic Pseudosignatures and Byzantine Agreement for t ≥ n/3 , 2007 .