Cryptology ePrint Archive: Report 2017/180

Robust P2P Primitives Using SGX Enclaves

Yaoqi Jia and Shruti Tople and Tarik Moataz and Deli Gong and Prateek Saxena and Zhenkai Liang

Abstract: Peer-to-peer (P2P) systems such as BitTorrent and Bitcoin are susceptible to serious attacks from byzantine nodes that join as peers. Research has explored many adversarial models with additional assumptions, ranging from mild (such as pre-established PKI) to strong (such as the existence of common random coins). One such widely-studied model is the general-omission model, which yields simple protocols with good efficiency, but has been considered impractical or unrealizable since it artificially limits the adversary only to omitting messages. In this work, we study the setting of a synchronous network wherein peer nodes have CPUs equipped with a recent trusted computing mechanism called Intel SGX. In this model, we observe that the byzantine adversary reduces to the adversary in the general-omission model. As a first result, we show that by leveraging SGX features, we eliminate any source of advantage for a byzantine adversary beyond that gained by omitting messages, making the general-omission model realizable. Second, we present new protocols that improve the communication complexity of two fundamental primitives — reliable broadcast and common random coins (or beacons) — in the synchronous setting, by utilizing SGX features. Our evaluation of 1000 nodes running on 40 DeterLab machines confirms theoretical efficiency claim.

Category / Keywords: cryptographic protocols / Distributed systems, SGX, Byzantine fault tolerance, Reliable broadcast, Random number generation

Date: received 23 Feb 2017, last revised 10 Jul 2020

Contact author: jiayaoqijia at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20200710:100423 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]