197 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author조성현-
dc.date.accessioned2023-04-25T01:34:33Z-
dc.date.available2023-04-25T01:34:33Z-
dc.date.issued2020-12-
dc.identifier.citationIEEE Access, v. 8.0, article no. 9294031, Page. 225613-225626-
dc.identifier.issn2169-3536-
dc.identifier.urihttps://ieeexplore.ieee.org/document/9294031/en_US
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/179235-
dc.description.abstractWith the development of blockchain technology, participants need to have huge storage volumes to deal with the growing blockchain ledger size over time. This requirement leads to the conditional participation and verification of participants, thus weakening the decentralization of a blockchain system. Several compression schemes have been proposed to mitigate this storage problem by compressing a blockchain ledger based on redundancy, modular functions, and hash functions. However, these schemes have the limitation of accumulating the compression results to validate the retained blocks. The accumulation gradually reduces the storage volume for the blockchain ledger within the storage volume of nodes with limited resources, thus reducing the verification capability of the nodes. In this paper, a selective compression scheme using a checkpoint-chain is proposed to prevent the accumulation of compression results. The checkpoint-chain is a second blockchain that stores the checkpoints compressing existing blocks through a block Merkle tree. An update process is also proposed to prevent the accumulation of checkpoints by combining them. As numerous blocks can be verified with only a few updated checkpoints, blockchain nodes with limited resources can reduce the storage volume for the blockchain ledger and achieve high verification capabilities. Finally, compared with the existing compression schemes, the proposed scheme can achieve an average reduction in the storage overhead and an average increase in the verification capability of 76.02% and 13.90%, respectively. Moreover, the corresponding performance improvements are 86.14% and 15.44% when the update process is performed, respectively. © 2013 IEEE.-
dc.languageen-
dc.publisherInstitute of Electrical and Electronics Engineers Inc.-
dc.subjectblock Merkle tree,~second blockchain-
dc.subjectBlockchain-
dc.subjectstorage efficiency-
dc.titleSELCOM: Selective Compression Scheme for Lightweight Nodes in Blockchain System-
dc.typeArticle-
dc.relation.volume8.0-
dc.identifier.doi10.1109/ACCESS.2020.3044991-
dc.relation.page225613-225626-
dc.relation.journalIEEE Access-
dc.contributor.googleauthorKim, S.-
dc.contributor.googleauthorKim, T.-
dc.contributor.googleauthorLee, S.-
dc.contributor.googleauthorKwon, Y.-
dc.contributor.googleauthorNoh, J.-
dc.contributor.googleauthorCho, S.-
dc.sector.campusE-
dc.sector.daehak소프트웨어융합대학-
dc.sector.department컴퓨터학부-
dc.identifier.pidchopro-
dc.identifier.article9294031-
Appears in Collections:
ETC[S] > ETC
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE