Scalable Blockchain Based Smart Contract Execution

被引:42
作者
Gao, Zhimin [1 ]
Xu, Lei [1 ]
Chen, Lin [1 ]
Shah, Nolan [1 ]
Lu, Yang [1 ]
Shi, Weidong [1 ]
机构
[1] Univ Houston, Comp Sci Dept, Houston, TX 77004 USA
来源
2017 IEEE 23RD INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS) | 2017年
关键词
smart contract; blockchain; scalability;
D O I
10.1109/ICPADS.2017.00054
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Blockchain, or distributed ledger, provides a way to build various decentralized systems without relying on any single trusted party. This is especially attractive for smart contracts, that different parties do not need to trust each other to have a contract, and the distributed ledger can guarantee correct execution of the contract. Most existing distributed ledger based smart contract systems process smart contracts in a serial manner, i.e., all users have to run a contract before its result can be accepted by the system. Although this approach is easy to implement and manage, it is not scalable and greatly limits the system's capability of handling a large number of smart contracts. In order to address this problem, we propose a scalable smart contract execution scheme that can run multiple smart contract in parallel to improve throughput of the system. Our scheme relies on two key techniques: a fair contract partition algorithm leveraging integer linear programming to partition a set of smart contracts into multiple subsets, and a random assignment protocol assigning subsets randomly to a subgroup of users. We prove that, our scheme is secure as long as more than 50% of the computational power is possessed by honest nodes. We then conduct experiments with data from existing smart contract system to evaluate the efficiency of our scheme. The results demonstrate that our approach is scalable and much more efficient than the existing smart contract platform.
引用
收藏
页码:352 / 359
页数:8
相关论文
共 41 条
[1]   SCIP: solving constraint integer programs [J].
Achterberg, Tobias .
MATHEMATICAL PROGRAMMING COMPUTATION, 2009, 1 (01) :1-41
[2]  
[Anonymous], 2005, SPRINGERS INT SERIES
[3]  
[Anonymous], 2001, FIPS PUB
[4]  
[Anonymous], 2015, Cryptology ePrint Archive
[5]  
Awerbuch B, 2006, LECT NOTES COMPUT SC, V4305, P275
[6]   Statistics of Random Permutations and the Cryptanalysis of Periodic Block Ciphers [J].
Bard, Gregory V. ;
Ault, Shaun V. ;
Courtois, Nicolas T. .
CRYPTOLOGIA, 2012, 36 (03) :240-262
[7]   Zerocash: Decentralized Anonymous Payments from Bitcoin [J].
Ben-Sasson, Eli ;
Chiesa, Alessandro ;
Garmant, Christina ;
Green, Matthew ;
Miers, Ian ;
Tromer, Eran ;
Virza, Madars .
2014 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2014), 2014, :459-474
[8]  
Bonneau J., 2015, IACR Cryptol. ePrint Arch., V2015
[9]   Brahms: Byzantine resilient random membership sampling [J].
Bortnikov, Edward ;
Gurevich, Maxim ;
Keidar, Idit ;
Kliot, Gabriel ;
Shraer, Alexander .
COMPUTER NETWORKS, 2009, 53 (13) :2340-2359
[10]  
Buterin V., 2014, CISC VIS NETW IND GL, V3, P2, DOI [10.5663/aps.v1i1.10138, DOI 10.5663/APS.V1I1.10138]