International Association for Cryptologic Research

International Association
for Cryptologic Research


Paper: Synchronous, with a Chance of Partition Tolerance

Yue Guo
Rafael Pass
Elaine Shi
DOI: 10.1007/978-3-030-26948-7_18 (login may be required)
Search ePrint
Search Google
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?
Video from CRYPTO 2019
  title={Synchronous, with a Chance of Partition Tolerance},
  booktitle={Advances in Cryptology – CRYPTO 2019},
  series={Lecture Notes in Computer Science},
  author={Yue Guo and Rafael Pass and Elaine Shi},