Cryptology ePrint Archive: Report 2019/179

Synchronous, with a Chance of Partition Tolerance

Yue Guo and Rafael Pass and Elaine Shi

Abstract: Murphy, Murky, Mopey, Moody, and Morose decide to write a paper together over the Internet and submit it to the prestigious CRYPTO’19 conference that has the most amazing PC. They encounter a few problems. First, not everyone is online every day: some are lazy and go skiing on Mondays; others cannot use git correctly and they are completely unaware that they are losing messages. Second, a small subset of the co-authors may be secretly plotting to disrupt the project (e.g., because they are writing a competing paper in stealth). Suppose that each day, sufficiently many honest co-authors are online (and use git correctly); moreover, suppose that messages checked into git on Monday can be correctly received by honest and online co-authors on Tuesday or any future day. Can the honest co-authors successfully finish the paper in a small number of days such that they make the CRYPTO deadline; and perhaps importantly, can all the honest co-authors, including even those who are lazy and those who sometimes use git incorrectly, agree on the final theorem?

Category / Keywords: foundations / synchronous, Byzantine Agreement, modeling, partition tolerance, MPC

Original Publication (with major differences): IACR-CRYPTO-2019

Date: received 18 Feb 2019, last revised 20 May 2019

Contact author: runting at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20190520:232241 (All versions of this report)

Short URL: ia.cr/2019/179


[ Cryptology ePrint archive ]