Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Byzantine agreement"”.

  1. Optimal algorithms for Byzantine agreement

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1988.

    mit Repository record for Optimal algorithms for Byzantine agreement (opens in a new tab)

  2. Practical, scalable algorithms for Byzantine agreement

    … problem in designing reliable algorithms is Byzantine agreement. For reasons of scalability, message complexity is a critical resource for this problem. Unfortunately, previous solutions to Byzantine agreement require each processor to send $O(n)$ messages, where $n$ is the total number of …

    unm Repository record for Practical, scalable algorithms for Byzantine agreement (opens in a new tab)

  3. Distributed computing with imperfect randomness

    … question in the affirmative, for the problem of Byzantine agreement. We construct protocols for Byzantine agreement in a variety of scenarios (synchronous or asynchronous networks, with or without private channels), in which the players have imperfect randomness. Our solutions are essentially as …

    mit Repository record for Distributed computing with imperfect randomness (opens in a new tab)

  4. Network-aware mechanisms for tolerating Byzantine failures in distributed systems

    … For the point-to-point model, we mainly consider Byzantine agreement algorithms. We develop algorithms that require only O(nL) total bits of communication for achieving agreement of L bits among n nodes for sufficiently large L, without making any cryptographic assumption. Previous algorithms …

    uiuc Repository record for Network-aware mechanisms for tolerating Byzantine failures in distributed systems (opens in a new tab)

  5. Randomized algorithms for reliable broadcast

    … of two efficient randomized protocols for Byzantine agreement, a classical problem in distributed computing. Byzantine agreement is the problem of simulating the reliable broadcast functionality in a network where all communication is person-to-person. We design two randomized Byzantine

    mit Repository record for Randomized algorithms for reliable broadcast (opens in a new tab)

  6. Fault-Tolerant Distributed Algorithms for Agreement and Election

    … the shared-memory requirements for achieving agreement in an asynchronous system of fail-stop processes that die undetectably. There is no agreement protocol that uses only read and write operations, even if at most one process dies. This result implies the impossibility of Byzantine agreement

    uiuc Repository record for Fault-Tolerant Distributed Algorithms for Agreement and Election (opens in a new tab)