Abstract
Sharding has been a highly expected solution for the blockchain scalability problem. But with computation power of honest miners (or stakes in PoS based systems) distributed in shards, it becomes easier for attackers to attack a single shard. In this research, we propose a new consensus algorithm, Greedy Observed Largest Forest (GOLF), aiming to consolidate distributed hash power in all shards to make attacking a single shard as hard as attacking the entire system.
Original language | English |
---|---|
Title of host publication | Information Security and Cryptology |
Subtitle of host publication | 15th International Conference, Inscrypt 2019 Nanjing, China, December 6–8, 2019 Revised Selected Papers |
Editors | Zhe Liu, Moti Yung |
Place of Publication | Cham Switzerland |
Publisher | Springer |
Pages | 309-322 |
Number of pages | 14 |
ISBN (Electronic) | 9783030429218 |
ISBN (Print) | 9783030429201 |
DOIs | |
Publication status | Published - 2019 |
Event | International Conference on Information Security and Cryptology (Inscript) 2019 - Nanjing, China Duration: 6 Dec 2019 → 8 Dec 2019 Conference number: 15th https://asclab.nuaa.edu.cn/inscrypt2019/main.psp https://link.springer.com/book/10.1007/978-3-030-42921-8 (Proceedings) |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 2020 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | International Conference on Information Security and Cryptology (Inscript) 2019 |
---|---|
Abbreviated title | Inscrypt 2019 |
Country/Territory | China |
City | Nanjing |
Period | 6/12/19 → 8/12/19 |
Internet address |
Keywords
- Attack
- Blockchain
- Consensus
- Scalability
- Sharding