• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.2
• /
• pp.271-277
• /
• 2022

PBFT (Practical Byzantine Fault Tolerant) is a consensus algorithm that can achieve consensus by resolving unintentional and intentional faults in a distributed network environment and can guarantee high performance and absolute finality. However, as the size of the network increases, the network load also increases due to message broadcasting that repeatedly occurs during the consensus process. Due to the characteristics of the PBFT algorithm, it is suitable for small/private blockchain, but there is a limit to its application to large/public blockchain. Because PBFT affects the performance of blockchain networks, the industry should test whether PBFT is suitable for products and services, and academia needs a unified evaluation metric and technology for PBFT performance improvement research. In this paper, quantitative evaluation metrics and evaluation frameworks that can evaluate PBFT family consensus algorithms are studied. In addition, the throughput, latency, and fault tolerance of PBFT are evaluated using the proposed PBFT evaluation framework.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.01a
• /
• pp.193-194
• /
• 2020

블록체인의 활용이 다양해지며 블록체인을 통한 산업, 정부의 기술적용이 확산되고 있다. 특히 사물인터넷 등 빅데이터 관리를 위한 방법으로 블록체인과의 융합도 적지 않게 거론되고 있다. 사물인터넷과 같은 빅데이터를 효과적으로 관리하기 위해서는 수집 및 저장과정과 더불어 투명하고 정확한 신뢰기반의 데이터 관리가 필요하다. 현재 블록체인의 프라이빗 블록체인 플랫폼에서 가장 많이 제시되고 활용되는 합의알고리즘은 PBFT이다. PBFT의 경우 노드 증가에 따른 연산알고리즘의 과중으로 인한 속도저하가 문제가 될 수 있다. 본 논문에서는 PBFT의 합의과정에 대한 알고리즘을 수정하여 노드 증가 시에도 복잡도를 낮출 수 있는 방법을 제안하였다. 본 논문에서는 시뮬레이션을 통하여 노드 개수를 변형하며 기존 PBFT알고리즘 대비 제안 알고리즘의 우수성을 증명한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.249-251
• /
• 2021

PBFT (Practical Byzantine Fault Tolerant) is a consensus algorithm that guarantees higher processing speed compared to PoW (Proof of Work) and absolute finality that records are not overturned due to the superiority of computing power. However, due to the complexity of the message, there is a limit that the network load increases exponentially as the number of participating nodes increases. PBFT is an important factor in determining the performance of a blockchain network, but studies on evaluation metrics and evaluation technologies are lacking. In this paper, we propose a PBFT evaluation framework that is convenient to change the consensus algorithm to easily evaluate quantitative indicators and improved methods for evaluating PBFT.

• Smart Media Journal
• /
• v.9 no.1
• /
• pp.9-15
• /
• 2020

Recently there have been increasing attempts to apply blockchains to businesses and public institutions. Blockchain is a distributed shared ledger with excellent transparency and security of data and through consensus algorithm, the same data can be shared to all nodes in order. In this paper, Modified PBFT which does not modify the PBFT consensus algorithm is proposed. MPBFT is able to tolerate Byzantine faults on a private blockchain on an asynchronous network. Even with the increase of participating nodes, the network communication cost can be effectively maintained. Modified PBFT takes into account the characteristics of an asynchronous network environment where node-to-node trust is guaranteed. In response to the client's request, PBFT performed the entire participation broadcast several times, but Modified PBFT enabled consensus and authentication through the 2 / N leader. By applying the Modified PBFT consensus algorithm, the broadcast process can be simplified to maintain the minimum number of nodes for consensus and to efficiently manage network communication costs.

• Journal of Internet Computing and Services
• /
• v.21 no.1
• /
• pp.17-31
• /
• 2020

With the rapid development of block chain technology, attempts have been made to put the block chain technology into practical use in various fields such as finance and logistics, and also in the public sector where data integrity is very important. Defense Operations In addition, strengthening security and ensuring complete integrity of the command communication network is crucial for operational operation under the network-centered operational environment (NCOE). For this purpose, it is necessary to construct a command communication network applying the block chain network. However, the block chain technology up to now can not solve the security issues such as the 51% attack. In particular, the Practical Byzantine fault tolerance (PBFT) algorithm which is now widely used in blockchain, does not have a penalty factor for nodes that behave maliciously, and there is a problem of failure to make a consensus even if malicious nodes are more than 33% of all nodes. In this paper, we propose a Adaptive Consensus Bound PBFT (ACB-PBFT) algorithm that incorporates a penalty mechanism for anomalous behavior by combining the Trust model to improve the security of the PBFT, which is the main agreement algorithm of the blockchain.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.2
• /
• pp.45-53
• /
• 2020

Blockchain can control transactions in a decentralized way and is already being considered for manufacturing, finance, banking, logistics, and medical industries due to its advantages such as transparency, security, and flexibility. And it is predicted to have a great economic effect. However, Blockchain has a Trilemma that is difficult to simultaneously improve scalability, decentralization and security characteristics. Among them, the biggest limitation of blockchain is scalability, which is very difficult to cope with the constantly increasing number of transactions and nodes. To make the blockchain scalable, higher performance should be achieved by modifying existing consensus methods or by improving the characteristics and network efficiency that affect many ways of scaling. Therefore, in this paper, we propose a cluster-based scalable PBFT consensus algorithm called CBS-PBFT which reduces the message complexity O(n²) of PBFT to O(n), which is a representative consensus algorithm of blockchain, and the validity is verified through simulation experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.4
• /
• pp.47-53
• /
• 2020

Blockchain is a distributed shared ledger that transparently manages information through verification and agreement between nodes connected to a distributed network. Recently, cases of data management among authorized agencies based on private blockchain are increasing. In this paper, we investigated the application cases and technical processes of PBFT, the representative consensus algorithm of private blockchain, and proposed a modified PBFT algorithm that enables efficient consensus by simplifying duplicate verification and consensus processes that occur during PBFT processing. The algorithm proposed in this paper goes through the process of selecting a delegation node through an authoritative node and can increase the safety of the delegation node selection process by considering an efficient re-election algorithm for candidate nodes. By utilizing this research, it is possible to reduce the burden on the network communication cost of the consensus process and effectively process the final consensus process between nodes.

• Journal of Information Processing Systems
• /
• v.18 no.6
• /
• pp.741-754
• /
• 2022

Openstack is widely used as a representative open-source infrastructure of the service (IaaS) platform. The Openstack Identity Service is a centralized approach component based on the token including the Memcached for cache, which is the in-memory key-value store. Token validation requests are concentrated on the centralized server as the number of differently encrypted tokens increases. This paper proposes the practical Byzantine fault tolerance (PBFT) blockchain-based Openstack Identity Service, which can improve the performance efficiency and reduce security vulnerabilities through a PBFT blockchain framework-based decentralized approach. The experiment conducted by using the Apache JMeter demonstrated that latency was improved by more than 33.99% and 72.57% in the PBFT blockchain-based Openstack Identity Service, compared to the Openstack Identity Service, for 500 and 1,000 differently encrypted tokens, respectively.

• Journal of Industrial Convergence
• /
• v.20 no.6
• /
• pp.37-45
• /
• 2022

With the development of the Internet of Things (IoT), related network infrastructures require new technologies to protect against threats such as external hacking. This study proposes an L-PBFT consensus algorithm that can protect IoT networks based on a blockchain consensus algorithm. We designed a blockchain (private) model suitable for small networks, tested processing performance for ultra-small/low-power IoT devices, and verified stability. As a result of performance analysis, L-PBFT proved that at least the number of nodes complies with the operation of the consensus algorithm(minimum 14%, maximum 29%) and establishes a trust network(separation of secure channels) different from existing security protocols. This study is a 4th industry convergence research and will be a foundation technology that will help develop IoT device security products in the future.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.2
• /
• pp.151-157
• /
• 2022

In this paper, the performance of various blockchain consensus algorithms was compared and analyzed as a method to increase the transaction cost and processing time during NFT transactions and to increase the transaction stability requirements that occur during smart contract execution. Network reliability and TPS are evaluation items for performance comparison. TPS and the stability of the Consensus algorithm are presented for three evaluation items. In order to establish a standardized expression for each evaluation item, the reliability of the node and the success rate of the smart contract were considered as variables in the calculation formula, and the performance of the consensus algorithm of the three groups, PoW/PoS, Paxos/Raft and PBFT, was compared under the same conditions. / analyzed. As a result of the performance evaluation, the network reliability of the three groups was similar, and in the case of the remaining two evaluation items, it was analyzed that the PBFT consensus algorithm was superior to other consensus algorithms. Through the performance evaluation equations and results of this study, it was analyzed that when the PBFT consensus processing process is reflected in the consensus process, the network reliability can be guaranteed and the stability and economic efficiency of the consensus algorithm can be increased.