Flipping Persuasively in Constant Time

DOI10.1137/0219032zbMath0698.68043OpenAlexW2144077075MaRDI QIDQ3476272

David B. Shmoys, Cynthia Dwork, Larry J. Stockmeyer

Publication date: 1990

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0219032

zbMATH Keywords

fault toleranceprobabilistic algorithmdistributed computingByzantine agreementcryptographic protocoldistributed coin

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25) Theory of software (68N99)

Related Items

Mathematical problems in cryptology, A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment, Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler, Leakage-resilient coin tossing, On expected constant-round protocols for Byzantine agreement, Simultaneity is harder than agreement, Leakage-Resilient Coin Tossing