Cryptology ePrint Archive: Report 2016/919

Snow White: Provably Secure Proofs of Stake

Phil Daian and Rafael Pass and Elaine Shi

Abstract: Decentralized cryptocurrencies have pushed deployments of distributed consensus to more stringent environments than ever before. Most existing protocols rely on proofs-of-work which require expensive computational puzzles to enforce, imprecisely speaking, “one vote per unit of computation”. The enormous amount of energy wasted by these protocols has been a topic of central debate, and well-known cryptocurrencies have announced it a top priority to alternative paradigms. Among the proposed alternative solutions, proofs-of-stake protocols have been of particular interest, where roughly speaking, the idea is to enforce “one vote per unit of stake”. Although the community have rushed to propose numerous candidates for proofs-of-stake, no existing protocol has offered formal proofs of security, which we believe to be a critical, indispensible ingredient of a distributed consensus protocol, particularly one that is to underly a high-value cryptocurrency system.

In this work, we seek to address the following basic questions:

• What kind of functionalities and robustness requirements should a consensus candidate offer to be suitable in a proof-of-stake application?

• Can we design a provably secure protocol that satisfies these requirements?

To the best of our knowledge, we are the first to formally articulate a set of requirements for consensus candidates for proofs-of-stake. We argue that any consensus protocol satisfying these properties can be used for proofs-of-stake, as long as money does not switch hands too quickly. Moreover, we provide the first consensus candidate that provably satisfies the desired robustness properties.

Category / Keywords: cryptographic protocols / consensus, blockchains, cryptocurrency, distributed systems, proofs-of-stake

Date: received 21 Sep 2016, last revised 17 Apr 2017

Contact author: runting at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20170417:191604 (All versions of this report)

Short URL: ia.cr/2016/919

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]