Consensus Algorithms In Distributed Ledger Technology For Open Environment

@article{Masood2018ConsensusAI,
  title={Consensus Algorithms In Distributed Ledger Technology For Open Environment},
  author={Faraz Masood and Arman Rasool Faridi},
  journal={2018 4th International Conference on Computing Communication and Automation (ICCCA)},
  year={2018},
  pages={1-6}
}
  • Faraz Masood, Arman Rasool Faridi
  • Published 1 December 2018
  • Computer Science
  • 2018 4th International Conference on Computing Communication and Automation (ICCCA)
Distributed Ledger Technology is getting famous day by day. Not only investors, financial organizations and technical personnel are interested in this technology, but also government and nearly every other organization are showing interest in this evolving technology. This technology deals with the settlement of transactions without the need of any third party. But it also requires that different nodes distributed all over the world should have the same state of the data to prevent faulty… Expand
1 Citations
Public Blockchain - a Systematic literature Review on the Sustainability of consensus Algorithms
TLDR
This work provides a systematic summary of consensus algorithms for public blockchains derived from the scientific literature as well as real-world applications and systematize them according to their research focus. Expand

References

SHOWING 1-10 OF 36 REFERENCES
The Ripple Protocol Consensus Algorithm
TLDR
This work presents a novel consensus algorithm that circumvents the requirement that all nodes within the network communicate synchronously by utilizing collectively-trusted subnetworks within the larger network and shows that minimal connectivity is required to maintain agreement throughout the whole network. Expand
Nano : A Feeless Distributed Cryptocurrency Network
Recently, high demand and limited scalability have increased the average transaction times and fees in popular cryptocurrencies, yielding an unsatisfactory experience. Here we introduce Nano, aExpand
Practical Byzantine fault tolerance
TLDR
A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude. Expand
OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding
TLDR
OmniLedger ensures security and correctness by using a bias-resistant public-randomness protocol for choosing large, statistically representative shards that process transactions, and by introducing an efficient cross-shard commit protocol that atomically handles transactions affecting multiple shards. Expand
Federated Byzantine Agreement to Ensure Trustworthiness of Digital Manufacturing Platforms
In this paper, we explore the use of the Stellar Consensus Protocol (SCP) and its Federated Byzantine Agreement (FBA) algorithm for ensuring trust and reputation between federated, cloud-basedExpand
The Sybil Attack
TLDR
It is shown that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities. Expand
Impossibility of distributed consensus with one faulty process
TLDR
It is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process, in the asynchronous consensus problem. Expand
The Tangle
In this paper we analyze the mathematical foundations of IOTA, a cryptocurrency for the Internet-of-Things (IoT) industry. The main feature of this novel cryptocurrency is the tangle, a directedExpand
Hashcash - A Denial of Service Counter-Measure
TLDR
This paper captures in one place the various applications, improvements suggested and related subsequent publications, and describes initial experience from experiments using hashcash. Expand
The Byzantine Generals Problem
TLDR
It is shown that, using only oral messages, the problem of a group of generals camped with their troops around an enemy city is solvable if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals. Expand
...
1
2
3
4
...