Open AccessAlgorithm based on Byzantine agreement among decentralized agents (BADA)
Author(s) -
Oh Jintae,
Park Joonyoung,
Kim Youngchang,
Kim Kiyoung
Publication year - 2020
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.2019-0489
Subject(s) - node (physics) , byzantine fault tolerance , computer science , block (permutation group theory) , quantum byzantine agreement , process (computing) , distributed computing , construct (python library) , consensus , decentralization , selection (genetic algorithm) , computer network , mathematics , fault tolerance , multi agent system , engineering , political science , artificial intelligence , geometry , structural engineering , law , operating system
Distributed consensus requires the consent of more than half of the congress to produce irreversible results, and the performance of the consensus algorithm deteriorates with the increase in the number of nodes. This problem can be addressed by delegating the agreement to a few selected nodes. Since the selected nodes must comply with the Byzantine node ratio criteria required by the algorithm, the result selected by any decentralized node cannot be trusted. However, some trusted nodes monopolize the consensus node selection process, thereby breaking decentralization and causing a trilemma. Therefore, a consensus node selection algorithm is required that can construct a congress that can withstand Byzantine faults with the decentralized method. In this paper, an algorithm based on the Byzantine agreement among decentralized agents to facilitate agreement between decentralization nodes is proposed. It selects a group of random consensus nodes per block by applying the proposed proof of nonce algorithm. By controlling the percentage of Byzantine included in the selected nodes, it solves the trilemma when an arbitrary node selects the consensus nodes.