본문 바로가기
  • Home

DPoS Consensus Algorithm using Counting Bloom Filter for blocked Double Spending Attack of Block Chain Attack

  • Journal of Internet of Things and Convergence
  • Abbr : JKIOTS
  • 2024, 10(6), pp.111-116
  • Publisher : The Korea Internet of Things Society
  • Research Area : Engineering > Computer Science > Internet Information Processing
  • Received : October 30, 2024
  • Accepted : December 3, 2024
  • Published : December 31, 2024

leesuyeon 1

1백석대학교

Accredited

ABSTRACT

The core of blockchain technology lies in the fact that instead of a centralized approach, individual nodes autonomously create blocks, but go through a consensus process so that eventually, all nodes have the same blockchain ledger. The technology used in this process is the consensus algorithm. Additionally, the consensus algorithm also helps solve the issue of double spending. To address this, the consensus algorithms used, such as Proof of Work (PoW), Proof of Stake (PoS), and Delegated Proof of Stake (DPoS), have been examined. Therefore, this paper aims to examine the types of double-spending attacks in blockchain and propose a Delegated Proof of Stake (DPoS) consensus algorithm incorporating Counting Bloom Filters (CBF) to prevent double-spending attacks and collusion among delegates.

Citation status

* References for papers published after 2023 are currently being built.