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

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

Paper 2020/037

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

Matthias Fitzi, Peter Gaži, 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.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint. MINOR revision.
Keywords: blockchain proof of stake throughput
Contact author(s): matthias fitzi @ iohk io
peter gazi @ iohk io
aggelos kiayias @ iohk io
acr @ cse uconn edu
History: 2020-01-15: received
Short URL: https://ia.cr/2020/037
License: CC BY

BibTeX

@misc{cryptoeprint:2020/037,
      author = {Matthias Fitzi and Peter Gaži and Aggelos Kiayias and Alexander Russell},
      title = {Proof-of-Stake Blockchain Protocols with Near-Optimal Throughput},
      howpublished = {Cryptology ePrint Archive, Paper 2020/037},
      year = {2020},
      note = {\url{https://eprint.iacr.org/2020/037}},
      url = {https://eprint.iacr.org/2020/037}
}