Ask a Question

Prefer a chat interface with context about you and your work?

Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity

Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity

We provide the first protocol that solves Byzantine agreement with optimal early stopping (min{f+2,t+1} rounds) and optimal resilience (n>3t) using polynomial message size and computation.