Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience

Ittai Abraham, Danny Dolev, and Joseph Y. Halpern

Details

Publication typeInproceedings
Published inPODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Pages405–414
ISBN978-1-59593-989-0
AddressNew York, NY, USA
PublisherACM
> Publications > An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience