Download here : Proof of Luck: an Efficient Blockchain Consensus Protocol
Source : https://arxiv.org/pdf/1703.05435.pdf
Extract from Abstract
Author Details
Mitar Milutinovic,UC Berkeley,mitar@cs.berkeley.edu
Warren He ,UC Berkeley,-w@berkeley.edu
Howard Wu,UC Berkeley,howardwu@berkeley.edu
Source : https://arxiv.org/pdf/1703.05435.pdf
Extract from 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.
Author Details
Warren He ,UC Berkeley,-w@berkeley.edu
Howard Wu,UC Berkeley,howardwu@berkeley.edu