東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Towards Efficient and Secure Sharding-Based Blockchain.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Towards Efficient and Secure Sharding-Based Blockchain./
作者:	Li, Mingzhe.
面頁冊數:	1 online resource (110 pages)
附註:	Source: Dissertations Abstracts International, Volume: 84-11, Section: B.
Contained By:	Dissertations Abstracts International84-11B.
標題:	Design. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30395916click for full text (PQDT)
ISBN:	9798379471149

Towards Efficient and Secure Sharding-Based Blockchain.
Li, Mingzhe.

Towards Efficient and Secure Sharding-Based Blockchain. - 1 online resource (110 pages)

Source: Dissertations Abstracts International, Volume: 84-11, Section: B.

Thesis (Ph.D.)--Hong Kong University of Science and Technology (Hong Kong), 2022.

Includes bibliographical references

Blockchain technology, despite its growing importance, has been argued for its poorscalability. Sharding has become an effective approach to addressing the scalability issuefaced in the blockchain. It divides nodes into multiple groups (shards) so that theycan process transactions in parallel. However, the efficiency and security in existingblockchain sharding systems, despite being the basic design objectives, still suffer frommany problems. To address these issues and achieve an efficient and secure blockchainsharding system, this thesis makes the following contributions.First, existing blockchain sharding protocols do not scale well when tackling smartcontracts (functions executing various logic). We present Jenga, a novel sharding-basedapproach for efficient smart contract processing. It requires all shards to share the logicfor all contracts, hence multiple smart contracts can be executed within one round. Moreover,different shards store distinct states (state shards), and several orthogonal executionchannels are established based on the state shards to reduce cross-shard communication.We implement Jenga and evaluation results illustrate that it achieves more than 1.5xthroughput gain compared to the existing cutting-edge work.Second, existing works, for security, tend to configure large shard sizes to maintaina small fraction of intra-shard malicious nodes, at an expense of limited concurrency.This leads to limited concurrency. Therefore, we propose CoChain, a highly concurrentand recoverable blockchain sharding system. It allows shards to have a larger fractionof malicious nodes (up to 2/3), thus reducing the shard size and increasing concurrency. To ensure security, CoChain requires shards to monitor each other, hence a shard with ahigh fraction of malicious nodes can recover from failure with the help of other shards.We implement CoChain based on Harmony and experimental results show that CoChainachieves a 35x throughput gain compared with Harmony.Third, existing blockchain sharding, during intra-shard consensus and cross-shardtransaction processing, either faces security issues or sacrifices great performance for security.Therefore, we propose SS-Chain for enhanced intra/cross-shard security and performance.We design pipelined consensus with less communication overhead to improveintra-shard consensus efficiency and defend against attacks via frequent leader rotations.We attach proofs to cross-shard transactions to ensure cross-shard security and improveefficiency through transaction batching and proof pruning. We implement SS-Chain andlarge-scale evaluation results demonstrate that it achieves a throughput of more than10,000 tx/sec even under malicious behaviors.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2023

Mode of access: World Wide Web

ISBN: 9798379471149Subjects--Topical Terms:

518875
Design.
Index Terms--Genre/Form:

542853
Electronic books.

Towards Efficient and Secure Sharding-Based Blockchain.
LDR:04009nmm a2200349K 4500 001 2362404
005 20231027104027.5
006 m o d
007 cr mn ---uuuuu
008 241011s2022 xx obm 000 0 eng d
020 $a 9798379471149
035 $a (MiAaPQ)AAI30395916
035 $a (MiAaPQ)HongKongSciTech_991013114548703412
035 $a AAI30395916
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Li, Mingzhe. $3 3703125
245 1 0 $a Towards Efficient and Secure Sharding-Based Blockchain.
264 0 $c 2022
300 $a 1 online resource (110 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 84-11, Section: B.
500 $a Advisor: Wang, Wei;Zhang, Jin.
502 $a Thesis (Ph.D.)--Hong Kong University of Science and Technology (Hong Kong), 2022.
504 $a Includes bibliographical references
520 $a Blockchain technology, despite its growing importance, has been argued for its poorscalability. Sharding has become an effective approach to addressing the scalability issuefaced in the blockchain. It divides nodes into multiple groups (shards) so that theycan process transactions in parallel. However, the efficiency and security in existingblockchain sharding systems, despite being the basic design objectives, still suffer frommany problems. To address these issues and achieve an efficient and secure blockchainsharding system, this thesis makes the following contributions.First, existing blockchain sharding protocols do not scale well when tackling smartcontracts (functions executing various logic). We present Jenga, a novel sharding-basedapproach for efficient smart contract processing. It requires all shards to share the logicfor all contracts, hence multiple smart contracts can be executed within one round. Moreover,different shards store distinct states (state shards), and several orthogonal executionchannels are established based on the state shards to reduce cross-shard communication.We implement Jenga and evaluation results illustrate that it achieves more than 1.5xthroughput gain compared to the existing cutting-edge work.Second, existing works, for security, tend to configure large shard sizes to maintaina small fraction of intra-shard malicious nodes, at an expense of limited concurrency.This leads to limited concurrency. Therefore, we propose CoChain, a highly concurrentand recoverable blockchain sharding system. It allows shards to have a larger fractionof malicious nodes (up to 2/3), thus reducing the shard size and increasing concurrency. To ensure security, CoChain requires shards to monitor each other, hence a shard with ahigh fraction of malicious nodes can recover from failure with the help of other shards.We implement CoChain based on Harmony and experimental results show that CoChainachieves a 35x throughput gain compared with Harmony.Third, existing blockchain sharding, during intra-shard consensus and cross-shardtransaction processing, either faces security issues or sacrifices great performance for security.Therefore, we propose SS-Chain for enhanced intra/cross-shard security and performance.We design pipelined consensus with less communication overhead to improveintra-shard consensus efficiency and defend against attacks via frequent leader rotations.We attach proofs to cross-shard transactions to ensure cross-shard security and improveefficiency through transaction batching and proof pruning. We implement SS-Chain andlarge-scale evaluation results demonstrate that it achieves a throughput of more than10,000 tx/sec even under malicious behaviors.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2023
538 $a Mode of access: World Wide Web
650 4 $a Design. $3 518875
650 4 $a Failure. $3 3561225
650 4 $a Protocol. $3 3564384
650 4 $a Communication. $3 524709
650 4 $a Computer science. $3 523869
655 7 $a Electronic books. $2 lcsh $3 542853
690 $a 0389
690 $a 0459
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 783688
710 2 $a Hong Kong University of Science and Technology (Hong Kong). $3 1022235
773 0 $t Dissertations Abstracts International $g 84-11B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30395916 $z click for full text (PQDT)