Corpus ID: 212415218

Que Sera Consensus: Simple Asynchronous Agreement with Private Coins and Threshold Logical Clocks

  title={Que Sera Consensus: Simple Asynchronous Agreement with Private Coins and Threshold Logical Clocks},
  author={B. Ford and P. Jovanovic and E. Syta},
  • B. Ford, P. Jovanovic, E. Syta
  • Published 2020
  • Computer Science
  • ArXiv
  • It is commonly held that asynchronous consensus is much more complex, difficult, and costly than partially-synchronous algorithms, especially without using common coins. This paper challenges that conventional wisdom with que sera consensus QSC, an approach to consensus that cleanly decomposes the agreement problem from that of network asynchrony. QSC uses only private coins and reaches consensus in $O(1)$ expected communication rounds. It relies on "lock-step" synchronous broadcast, but can… CONTINUE READING
    1 Citations


    Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus
    • 5
    • PDF
    Hybrid Consensus: Efficient Consensus in the Permissionless Model
    • 248
    • PDF
    Signature-free asynchronous byzantine consensus with t < n/3 and o(n2) messages
    • 54
    • PDF
    Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems
    • 33
    From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures
    • 118
    • PDF
    Asynchronous consensus and broadcast protocols
    • 442
    • PDF
    Randomized protocols for asynchronous consensus
    • J. Aspnes
    • Computer Science
    • Distributed Computing
    • 2003
    • 141
    • PDF
    Asymptotically Optimal Validated Asynchronous Byzantine Agreement
    • 34
    • Highly Influential
    • PDF
    Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography
    • 300
    • Highly Influential
    • PDF
    Secure INtrusion-Tolerant Replication on the Internet
    • C. Cachin, J. Poritz
    • Computer Science
    • Proceedings International Conference on Dependable Systems and Networks
    • 2002
    • 152
    • PDF