Consolidating hash power in blockchain shards with a forest

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

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 languageEnglish
Title of host publicationInformation Security and Cryptology
Subtitle of host publication15th International Conference, Inscrypt 2019 Nanjing, China, December 6–8, 2019 Revised Selected Papers
EditorsZhe Liu, Moti Yung
Place of PublicationCham Switzerland
PublisherSpringer
Pages309-322
Number of pages14
ISBN (Electronic)9783030429218
ISBN (Print)9783030429201
DOIs
Publication statusPublished - 2019
EventInternational Conference on Information Security and Cryptology 2019 - Nanjing, China
Duration: 6 Dec 20198 Dec 2019
Conference number: 15th
https://asclab.nuaa.edu.cn/inscrypt2019/main.psp

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume2020
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Information Security and Cryptology 2019
Abbreviated titleInscrypt 2019
CountryChina
CityNanjing
Period6/12/198/12/19
Internet address

Keywords

  • Attack
  • Blockchain
  • Consensus
  • Scalability
  • Sharding

Cite this