Cryptology ePrint Archive: Report 2018/060

A Simple Reduction from State Machine Replication to Binary Agreement in Partially Synchronous or Asynchronous Networks

Abhinav Aggarwal and Yue Guo

Abstract: The recent advent of blockchains has spurred a huge interest in the research and development of numerous cryptocurrencies as well as understanding the fundamental concepts that underly this technology. At the heart of this design is the classic state machine replication protocol in which a group of n machines (out of which f are Byzantine) want to agree on an ever-growing log of transactions. In this paper, we present a simple black box reduction from state machine replication (SMR) to the classical binary agreement (BA) protocol on top of a fully decentralized network. We consider both synchronous and partially synchronous/asynchronous settings for our reduction. We also present an algorithm for a reduction from BA to SMR, thus establishing an equivalence between the two. In each of these settings, we analyze our algorithms with respect to the required security properties. Although there is prior work that establishes these reductions, our solutions are simpler (at the cost of efficiency) and useful from a pedagogical point of view.

Category / Keywords: foundations /

Date: received 14 Jan 2018

Contact author: abhiag6891 at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20180116:131918 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]