No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Алгоритми Консенсусу у BlockChain Корпоративних Системах
Abstract
The concept of the new generation of the Internet is based on decentralization and today is widely implemented in cryptocurrency tokens and information systems based on blockchain technology. The purpose of the article is to investigate the impact of algorithms for confirming the authenticity of information on the effectiveness of the functioning of corporate information systems using blockchain technology through the analysis of existing concepts of consensus. The scheme of the corporate information system of document circulation proposed by the authors of the article in previous works using blockchain technology is based on ensuring the decentralization of the system and the integrity of data regarding the preservation and revision of the institution's documents. To automate the consensus process using a smart contract, the system uses a dynamic consensus. Концепція нового покоління Інтернету заснована на децентралізації і сьогодні широко реалізована в токенах криптовалюти та інформаційних системах на основі технології блокчейн. Метою статті є дослідження впливу алгоритмів підтвердження достовірності інформації на ефективність функціонування корпоративних інформаційних систем з використанням технології блокчейн через аналіз існуючих концепцій консенсусу. Запропонована авторами статті в попередніх роботах схема корпоративної інформаційної системи документообігу з використанням технології блокчейн базується на забезпеченні децентралізації системи та цілісності даних щодо збереження та перегляду документів установи. Для автоматизації процесу консенсусу за допомогою смарт-контракту система використовує динамічний консенсус.
ResearchGate has not been able to resolve any citations for this publication.
Like any other distributed system, the Blockchain technology relies on consensus algorithms in order to reach agreement and secure its network. Over the past few years, several kinds of consensus algorithms were created in the Blockchain ecosystem. In this paper, we present some main consensus algorithms used by the Blockchain technology. We also provide a comparison summary of their advantages and weaknesses as well as in which Blockchain type can be used. Furthermore, we present some challenges and possible directions related to the trendiest domains. With this work, for a given situation, we hope to help to choose the right algorithm to use. In addition, we hope to give directions to new possible algorithms propositions.
The rapid development of blockchain technology and their numerous emerging applications have received huge attention in recent years. The distributed consensus mechanism is the backbone of a blockchain network. It plays a key role in ensuring the network, s security, integrity, and performance. Most current blockchain networks have been deploying the Proof-of-Work consensus mechanisms, in which the consensus is reached through intensive mining processes. However, this mechanism has several limitations, e.g., energy inefficiency, delay, and vulnerable to security threats. To overcome these problems, a new consensus mechanism has been developed recently, namely Proof-of-Stake, which enables to achieve the consensus via proving the stake ownership. This mechanism is expected to become a cutting-edge technology for future blockchain networks. This paper is dedicated to investigate Proof-of-Stake mechanisms, from fundamental knowledge to advanced Proof-of-Stake-based protocols along with performance analysis, e.g., energy consumption, delay, and security, as well as their promising applications, particularly in the field of Internet-of-Vehicles. The formation of stake pools and their effects on the network stake distribution are also analyzed and simulated. The results show that the ratio between the block reward and the total network stake has a significant impact on the decentralization of the network. Technical challenges and potential solutions are also discussed.
We present “Ouroboros”, the first blockchain protocol based on proof of stake with rigorous security guarantees. We establish security properties for the protocol comparable to those achieved by the bitcoin blockchain protocol. As the protocol provides a “proof of stake” blockchain discipline, it offers qualitative efficiency advantages over blockchains based on proof of physical resources (e.g., proof of work). We also present a novel reward mechanism for incentivizing Proof of Stake protocols and we prove that, given this mechanism, honest behavior is an approximate Nash equilibrium, thus neutralizing attacks such as selfish mining.
Proof of Work (PoW) powered blockchains currently account for more than 90% of the total market capitalization of existing digital cryptocurrencies. Although the security provisions of Bitcoin have been thoroughly analysed, the security guarantees of variant (forked) PoW blockchains (which were instantiated with different parameters) have not received much attention in the literature. This opens the question whether existing security analysis of Bitcoin's PoW applies to other implementations which have been instantiated with different consensus and/or network parameters.
In this paper, we introduce a novel quantitative framework to analyse the security and performance implications of various consensus and network parameters of PoW blockchains. Based on our framework, we devise optimal adversarial strategies for double-spending and selfish mining while taking into account real world constraints such as network propagation, different block sizes, block generation intervals, information propagation mechanism, and the impact of eclipse attacks. Our framework therefore allows us to capture existing PoW-based deployments as well as PoW blockchain variants that are instantiated with different parameters, and to objectively compare the tradeoffs between their performance and security provisions.
Blockchain, as a potentially revolutionary technology, has been used in cryptocurrency to record transactions chronologically among multiple parties. Due to the fast development of the blockchain and its de-centralization, blockchain technology has been applied in broader scenarios, such as smart factories, supply chains, and smart cities. Consensus protocol plays a vital role in the blockchain, which addresses the issue of reaching consensus on transaction results among involved participants. Nevertheless, with the complexity of the network environment and growing amount of network users, the advance of blockchain is gradually restricted by the efficiency, security and reliability of consensus protocols. In this paper, we propose a delegated randomization Byzantine fault tolerance consensus protocol named DRBFT based on Practical Byzantine Fault Tolerance(PBFT) to enhance the efficiency and reliability of the consensus procedure. Specifically, a random selection algorithm called RS is developed to cooperate with the voting mechanism, which can effectively reduce the number of nodes participating in the consensus process. Our proposed scheme is characterized by the unpredictability, randomicity and impartiality, which accelerate the system to reach consensus on the premise of ensuring the system activity. Furthermore, the feasibility of our proposed scheme is also proved by both theoretical analysis and experimental evaluations.
This paper presents Istanbul BFT (IBFT), a Byzantine fault-tolerant (BFT) consensus algorithm that is used for implementing state-machine replication in the Quorum blockchain, n open source permissioned blockchain platform. IBFT belongs to a class of BFT algorithms that assume a partially synchronous communication model. The IBFT algorithm is deterministic, leader-based, and optimally resilient - tolerating f faulty processes out of n, where . During periods of good communication, IBFT achieves termination in three message delays. The communication complexity is for normal operation and O(n) for round (or view) changes. We also introduce a variant of IBFT, which achieves O(n) communication complexity during both normal operation and view changes at a small latency penalty compared to IBFT - from 3 to 5 message delays.
How the technology behind Bitcoin is changing money, business, and the world. Penguin Random House LLC
- Don Tapscott
- Alex Tapscott
Don Tapscott, Alex Tapscott. Blockchain Revolution. How the
technology behind Bitcoin is changing money, business, and the
world. Penguin Random House LLC, New York, 2016. P. 324.
URL:
https://itig-iraq.iq/wp-content/uploads/2019/05/
Blockchain_Revolution.pdf.
Ouroboros-BFT: A Simple Byzantine Fault Tolerant Consensus Protocol
- Kiayias Aggelos
- Russell Alexander
Kiayias Aggelos, Russell Alexander. Ouroboros-BFT: A Simple
Byzantine Fault Tolerant Consensus Protocol. Cryptology ePrint
Archive (Report 2018/1049). Retrieved November 23, 2020.
URL: https://eprint.iacr.org/2018/1049.
Overview of 9 blockchain consensus algorithms. DigitalForest Blog
- Kirill Grigorchuk
Kirill Grigorchuk. Overview of 9 blockchain consensus
algorithms.
DigitalForest
Blog.
2019.
URL:
https://digiforest.io/en/blog/blockchain-consensus-algorithms.
Алгоритми консенсуса блокчейн систем. Вісник Хмельницького національного університету. Серія: Технічні науки
- В В Кучковський
Кучковський В. В. Алгоритми консенсуса блокчейн систем.
Вісник Хмельницького національного університету. Серія:
Технічні науки. № 3 (297), 2021. С. 30-33.
Practical Byzantine fault tolerance
- M Castro
- B Liskov
CASTRO, M. AND LISKOV, B. 1999b. Practical Byzantine
fault tolerance. In Proceedings of the Third Symposium on
Operating Systems Design and Implementation (OSDI),
USENIX, New Orleans, USA, February 1999. URL:
https://pmg.csail.mit.edu/papers/osdi99.pdf.
Verifiable Byzantine Fault Tolerance (VBFT) consensus
- Garima Singh
Garima Singh.Verifiable Byzantine Fault Tolerance (VBFT)
consensus. URL: https://www.linkedin.com/pulse/verifiablebyzantine-fault-tolerance-vbft-consensus-garima-singh-t9bhf.