Byzantine agreement in polynomial expected time: [extended abstract]

@inproceedings{King2013ByzantineAI,
  title={Byzantine agreement in polynomial expected time: [extended abstract]},
  author={Valerie King and Jared Saia},
  booktitle={STOC},
  year={2013}
}
In the classic asynchronous Byzantine agreement problem, communication is via asynchronous message-passing and the adversary is adaptive with full information. In particular, the adversary can adaptively determine which processors to corrupt and what strategy these processors should use as the algorithm proceeds; the scheduling of the delivery of messages is set by the adversary, so that the delays are unpredictable to the algorithm; and the adversary knows the states of all processors at any… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-6 of 6 references

The Byzantine generals problem

  • L. Lamport, R. Shostak, M. Pease
  • ACM Transactions on Programming Languages and…
  • 1982
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…