For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Efficient Randomized Byzantine Fault-Tolerant Replication Based on Special Valued Coin Tossing
Junya NAKAMURA Tadashi ARARAGI Shigeru MASUYAMA Toshimitsu MASUZAWA
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2014/02/01
Online ISSN: 1745-1361
Print ISSN: 0916-8532
Type of Manuscript: PAPER
Category: Dependable Computing
Byzantine fault tolerance, state machine replication, Byzantine agreement, consensus, asynchronous distributed system,
Full Text: PDF(1.4MB)>>
We propose a fast and resource-efficient agreement protocol on a request set, which is used to realize Byzantine fault tolerant server replication. Although most existing randomized protocols for Byzantine agreement exploit a modular approach, that is, a combination of agreement on a bit value and a reduction of request set values to the bit values, our protocol directly solves the multi-valued agreement problem for request sets. We introduce a novel coin tossing scheme to select a candidate of an agreed request set randomly. This coin toss allows our protocol to reduce resource consumption and to attain faster response time than the existing representative protocols.