Cryptology ePrint Archive: Report 2020/037

Proof-of-Stake Blockchain Protocols with Near-Optimal Throughput

Matthias Fitzi and Peter Gaži and Aggelos Kiayias and Alexander Russell

Abstract: One of the most significant challenges in the design of blockchain protocols is increasing their transaction-processing throughput. In this work we put forth for the first time a formal execution model that enables to express transaction throughput while supporting formal security arguments regarding persistence and liveness. We then present a protocol in the proof-of-stake setting achieving near-optimal throughput under adaptive active corruption of any minority of the stake.

Category / Keywords: cryptographic protocols / blockchain, proof of stake, throughput

Date: received 14 Jan 2020

Contact author: matthias fitzi at iohk io,peter gazi@iohk io,aggelos kiayias@iohk io,acr@cse uconn edu

Available format(s): PDF | BibTeX Citation

Version: 20200115:092841 (All versions of this report)

Short URL: ia.cr/2020/037


[ Cryptology ePrint archive ]