An SGX-based execution framework for smart contracts upon permissioned blockchain

Guardado en:
Detalles Bibliográficos
Publicado en:Distributed and Parallel Databases vol. 42, no. 2 (Jun 2024), p. 143
Autor principal: Fang, Min
Otros Autores: Zhang, Zhao, Jin, Cheqing, Zhou, Aoying
Publicado:
Springer Nature B.V.
Materias:
Acceso en línea:Citation/Abstract
Full Text
Full Text - PDF
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

MARC

LEADER 00000nab a2200000uu 4500
001 3255419703
003 UK-CbPIL
022 |a 0926-8782 
022 |a 1573-7578 
024 7 |a 10.1007/s10619-022-07409-7  |2 doi 
035 |a 3255419703 
045 2 |b d20240601  |b d20240630 
100 1 |a Fang, Min  |u School of Data Science and Engineering, East China Normal University, Shanghai, China (GRID:grid.22069.3f) (ISNI:0000 0004 0369 6365) 
245 1 |a An SGX-based execution framework for smart contracts upon permissioned blockchain 
260 |b Springer Nature B.V.  |c Jun 2024 
513 |a Journal Article 
520 3 |a Since consensus protocol and execution mechanism act as two key factors for the overall throughput of blockchain systems, how to execute smart contracts efficiently becomes an emergent bottleneck as many high-performance consensus protocols have been proposed in recent years. Due to the existence of Byzantine nodes, existing concurrency approaches can only achieve intra-node concurrency, not inter-node concurrency. Fortunately, since the trust among nodes can be achieved based on the confidentiality guarantee provided by the trusted execution environment, such as Intel Software Guard Extensions (SGX), we propose a novel concurrent execution framework using SGX, which is the first to achieve both intra- and inter-node concurrency. Specifically, each replica executes the task assigned by the primary in parallel and gets trusted results using SGX firstly. Then, each node obtains the execution results of others via state replication to achieve consistency. However, we must ensure the integrity and correctness of all data transferred to SGX for getting the trusted results. Therefore, we design a novel approach to efficiently generate Merkle multiproofs and verify data in parallel. Theoretical analysis and experimental results show that the proposed scheme significantly outperforms state-of-art solutions. 
653 |a Scheduling 
653 |a Software 
653 |a Blockchain 
653 |a Contracts 
653 |a Concurrency control 
653 |a Protocol 
653 |a Smart contracts 
653 |a Concurrency 
653 |a Efficiency 
653 |a Nodes 
700 1 |a Zhang, Zhao  |u School of Data Science and Engineering, East China Normal University, Shanghai, China (GRID:grid.22069.3f) (ISNI:0000 0004 0369 6365); Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin, China (GRID:grid.440723.6) (ISNI:0000 0001 0807 124X) 
700 1 |a Jin, Cheqing  |u School of Data Science and Engineering, East China Normal University, Shanghai, China (GRID:grid.22069.3f) (ISNI:0000 0004 0369 6365) 
700 1 |a Zhou, Aoying  |u School of Data Science and Engineering, East China Normal University, Shanghai, China (GRID:grid.22069.3f) (ISNI:0000 0004 0369 6365) 
773 0 |t Distributed and Parallel Databases  |g vol. 42, no. 2 (Jun 2024), p. 143 
786 0 |d ProQuest  |t Advanced Technologies & Aerospace Database 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/3255419703/abstract/embedded/L8HZQI7Z43R0LA5T?source=fedsrch 
856 4 0 |3 Full Text  |u https://www.proquest.com/docview/3255419703/fulltext/embedded/L8HZQI7Z43R0LA5T?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/3255419703/fulltextPDF/embedded/L8HZQI7Z43R0LA5T?source=fedsrch