Cryptology ePrint Archive: Report 2018/863

Helix: A Scalable and Fair Consensus Algorithm Resistant to Ordering Manipulation

Avi Asayag and Gad Cohen and Ido Grayevsky and Maya Leshkowitz and Ori Rottenstreich and Ronen Tamari and David Yakira

Abstract: We present Helix, a Byzantine fault tolerant and scalable consensus algorithm for fair ordering of transactions among nodes in a distributed network. In Helix, one among the network nodes proposes a potential set of successive transactions (block). The known PBFT protocol is then run within a bounded-size committee in order to achieve agreement and commit the block to the blockchain indefinitely. In Helix, transactions are encrypted via a threshold encryption scheme in order to hide information from the ordering nodes, limiting censorship and front-running. The encryption is further used to realize a verifiable source of randomness, which in turn is used to elect the committees in an unpredictable way, as well as to introduce a correlated sampling scheme of transactions included in a proposed block. The correlated sampling scheme restricts nodes from promoting their own transactions over those of others. Nodes are elected to participate in committees in proportion to their relative reputation. Reputation, attributed to each node, serves as a measure of obedience to the protocol's instructions. Committees are thus chosen in a way that is beneficial to the protocol.

Category / Keywords: Blockchain, Consensus protocol, Byzantine agreement

Original Publication (with major differences): IEEE International Conference on Network Protocols (ICNP) 2018

Date: received 13 Sep 2018

Contact author: ori at orbs com

Available format(s): PDF | BibTeX Citation

Version: 20180922:180054 (All versions of this report)

Short URL: ia.cr/2018/863


[ Cryptology ePrint archive ]