Cryptology ePrint Archive: Report 2020/195

Replicated state machines without replicated execution

Jonathan Lee and Kirill Nikitin and Srinath Setty

Abstract: This paper introduces a new approach to reduce end-to-end costs in large-scale replicated systems built under a Byzantine fault model. Specifically, our approach transforms a given replicated state machine (RSM) to another RSM where nodes incur lower costs by delegating state machine execution: an untrusted prover produces succinct cryptographic proofs of correct state transitions along with state changes, which nodes in the transformed RSM verify and apply respectively.

To realize our approach, we build Piperine, a system that makes the proof machinery profitable in the context of RSMs. Specifically, Piperine reduces the costs of both proving and verifying the correctness of state machine execution while retaining liveness—a distinctive requirement in the context of RSMs. Our experimental evaluation demonstrates that, for a payment service, employing Piperine is more pro table than naive reexecution of transactions as long as there are $>10^4$ nodes. When we apply Piperine to ERC-20 transactions in Ethereum (a real-world RSM with up to $10^5$ nodes), it reduces per-transaction costs by $5.4\times$ and network costs by $2.7\times$.

Category / Keywords: implementation / verifiable computing, zkSNARKs, blockchain, replicated state machines

Original Publication (with minor differences): IEEE Symposium on Security and Privacy (S&P) 2020

Date: received 16 Feb 2020, last revised 16 Feb 2020

Contact author: srinath at microsoft com

Available format(s): PDF | BibTeX Citation

Version: 20200218:090958 (All versions of this report)

Short URL: ia.cr/2020/195


[ Cryptology ePrint archive ]