Now showing items 4-5 of 5

    • Simple and Efficient Byzantine General Algorithms with Early Stopping 

      Toueg, Sam; Perry, Kenneth J.; Srikanth, T. K. (Cornell University, 1984-07)
      We describe a Byzantine Agreement algorithm, with early stopping, for systems with arbitrary process failures. The algorithm presented is simpler and more efficient than those previously known. It was derived using a ...
    • Simulating Authenticated Broadcasts to Derive Simple Fault-Tolerant Algorithms 

      Srikanth, T. K.; Toueg, Sam (Cornell University, 1984-07)
      Fault-tolerant algorithms for distributed systems are simpler to develop and prove correct if messages can be authenticated. However, using digital signatures for message authentication usually incurs substantial overhead ...