ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Algorithm based on Byzantine Agreement among Decentralized Agents (BADA)
Cited 0 time in scopus Download 185 time Share share facebook twitter linkedin kakaostory
저자
오진태, 박준영, 김영창, 김기영
발행일
202012
출처
ETRI Journal, v.42 no.6, pp.872-885
ISSN
1225-6463
출판사
한국전자통신연구원 (ETRI)
DOI
https://dx.doi.org/10.4218/etrij.2019-0489
협약과제
19HS2200, 블록체인(PON 알고리즘)기반 고신뢰 정보거래 플랫폼 기술개발, 김기영
초록
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.
KSP 제안 키워드
Byzantine agreement, Byzantine faults, Consensus algorithm, Decentralized agents, Distributed consensus, Selection process, Trusted Node, decentralized method, node Selection, selection algorithm
본 저작물은 공공누리 제4유형 : 출처표시 + 상업적 이용금지 + 변경금지 조건에 따라 이용할 수 있습니다.
제4유형