Byzantine Agreement in Expected Polynomial Time

DOI10.1145/2837019zbMath1426.68024OpenAlexW2311002194MaRDI QIDQ3177770

Jared Saia, Valerie King

Publication date: 2 August 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2837019

zbMATH Keywords

randomizationsecurityspectral methodsByzantine agreementglobal coin

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Randomized algorithms (68W20)

Related Items (5)

Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems ⋮ Byzantine preferential voting ⋮ Algorand: a secure and efficient distributed ledger ⋮ Fault-tolerant graph realizations in the congested clique ⋮ Quantum Byzantine agreement with tripartite entangled states

This page was built for publication: Byzantine Agreement in Expected Polynomial Time