Synchronous, with a chance of partition tolerance

DOI10.1007/978-3-030-26948-7_18zbMath1456.94081OpenAlexW2926580575MaRDI QIDQ2181863

Rafael Pass, Elaine Shi, Yue Guo

Publication date: 20 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26948-7_18

zbMATH Keywords

leader electionreliable broadcastweak synchronous network

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Synchronous consensus with optimal asynchronous fallback guarantees ⋮ The availability-accountability dilemma and its resolution via accountability gadgets ⋮ Transparent batchable time-lock puzzles and applications to Byzantine consensus ⋮ \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions ⋮ On linear communication complexity for (maximally) fluid MPC ⋮ MPC with synchronous security and asynchronous responsiveness ⋮ Secure MPC: laziness leads to GOD ⋮ Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback ⋮ How Byzantine is a send corruption?

This page was built for publication: Synchronous, with a chance of partition tolerance