An Efficient Algorithm For Byzantine Agreement Without Authentication

Toueg, S., Perry, K.J., Srikanth, T.K.: Fast distributed agreement. SIAM J. Comput. 16 (3), 445-457 (1987) Hadzilacos, V. Connectivity requirements for Byzantine agreements in limited cases of failures. Distrib Comput 2, 95-103 (1987). doi.org/10.1007/BF01667081 Srikanth, T.K., Toueg, S.: Simulating authenticates shipments to deduce simple algorithms tolerant to failures. Mr. Distrib. It`s Comput. 2 (2), 80-94 (1987) Barak, B., Canetti, R., Lindell, Y., Pass, R., Rabin, T.: Safe calculation without authentication. In: Proc. 25th Annual International Cryptology Conference (CRYPTO), p.

361-377 (2005) Garay, J.A., Moses, Y.: Fully polynomial Byzantine agreement for n>3t processors in t-1 rounds. SIAM J. Comput. 27 (1), 247-290 (1998) Dolev, D., Strong, H.R.: Authenticated algorithms for Byzantine agreement. SIAM J. Comput. 12 (4), 656-666 (1983) Turpin, R., Coan, B.A.: Extending binary Byzantine agreement to multivalued Byzantine agreement. Inf. Trial.

Lett. 18 (2), 73-76 (1984) The Byzantine Convention includes a system of n processes, some of which may be defective. The problem is that the appropriate processes agree on a binary value issued by an issuer that may itself be one of the processes. If the issuer sends the same value to each process, then all correct processes must agree on that value, but in any case, they must agree on a certain value. An explicit solution without authentication is given for no 3t – 1-process with 2t – 3 rounds and bits of O messages (t3 log t). This solution can be easily extended to the general case of n ⩾ 3t -1 to give a solution with 2t – 3 rounds and O (nt t3 log t) bits of message. We study the problem of obtaining Byzantine agreements in any network where processors and communications are subject to omissions or disruptions. For deterministic and synchronized algorithms, we provide a necessary and sufficient condition that combines problem solving with network connectivity. In particular, we show that an algorithm that resists at most faulty processors and faulty connections that are omitted or shut down is present if and only if the network has a pair of connections (t, k) > (t, k). Okun, M., Barak, A.: On the anonymous Byzantine arrangement. Leibniz Center TR 2004-2, School of Computer Science, The Hebrew University (2004) Pease, M., Shostak, R., Lamport, L.: reaching an agreement in case of error.

J. ACM 27 (2), 228-234 (1980) Dolev, D., Fischer, M.J., Fowler, R., Lynch, N.A., Strong, H.R.: An effective algorithm for Byzantine arrangement without authentication. Inf. Control 52 (3), 257-274 (1982) Dolev, D., Reischuk, R., Strong, H.R.: Early stopping in Byzantine`s agreement. J. ACM 37 (4), 720-741 (1990) Fischer, M.J., Lynch, N.A., Merritt, M.: Easy unpossibility proofs for distributed consensus problems. Mr. Distrib. It`s Comput. 1 (1), 26-39 (1986) This work was partially supported by the National Science Foundation under Grant MCS80-04111. This is an overview of the content of the subscription, log in to check access. Chaum, D.: elections with unconditional votes and disruptions that correspond to the breakdown of the RSA.

In: Proc. EUROCRYPT, p. 177-182 (1988) Cohen, J.D., Fischer, M.J.: A robust and verifiable cryptographic grid. In: Proc. 26th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Pp. 372-382 (1985) Chaum, D., Crepeau, C., Damgard, I.: Unconditionally Safe Multi-Party Protocols. In: Proc. 20th ACM Symposium on Theory of Computing (STOC), 11-19 (1988). Dolev D, Strong HR (1982) Distributed commit with limited expectation. Proc 2nd IEEE Symp on Reliability in Dist`d Software and Database Systems, Pittsburgh, PA, p. 53-60 Chaum, D.: Blind signatures for untraceable payments.

In: Proc. CRYPTO, 199-203 (1982) . Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn.

This entry posted in Uncategorized. Bookmark the permalink. 

Comments are closed.