Proof of Luck: an Efficient Blockchain Consensus Protocol

Mitar Milutinovic; Warren He; Howard Wu; Maxinder Kanwal

Paper 2017/249

Proof of Luck: an Efficient Blockchain Consensus Protocol

Mitar Milutinovic, Warren He, Howard Wu, and Maxinder Kanwal

Abstract

In the paper, we present designs for multiple blockchain consensus primitives and a novel blockchain system, all based on the use of trusted execution environments (TEEs), such as Intel SGX-enabled CPUs. First, we show how using TEEs for existing proof of work schemes can make mining equitably distributed by preventing the use of ASICs. Next, we extend the design with proof of time and proof of ownership consensus primitives to make mining energy- and time-efficient. Further improving on these designs, we present a blockchain using a proof of luck consensus protocol. Our proof of luck blockchain uses a TEE platform's random number generation to choose a consensus leader, which offers low-latency transaction validation, deterministic confirmation time, negligible energy consumption, and equitably distributed mining. Lastly, we discuss a potential protection against up to a constant number of compromised TEEs.

Metadata

Available format(s): PDF
Category: Applications
Publication info: Published elsewhere. Minor revision. SysTEX '16 Proceedings of the 1st Workshop on System Software for Trusted Execution
DOI: 10.1145/3007788.3007790
Keywords: trusted computing
Contact author(s): mitar @ cs berkeley edu
History: 2017-03-20: received
Short URL: https://ia.cr/2017/249
License: CC BY

BibTeX

@misc{cryptoeprint:2017/249,
      author = {Mitar Milutinovic and Warren He and Howard Wu and Maxinder Kanwal},
      title = {Proof of Luck: an Efficient Blockchain Consensus Protocol},
      howpublished = {Cryptology {ePrint} Archive, Paper 2017/249},
      year = {2017},
      doi = {10.1145/3007788.3007790},
      url = {https://eprint.iacr.org/2017/249}
}