Integrity-Enhancing Replica Coordination for Byzantine Fault Tolerant Systems
Wenbing Zhao

TL;DR
This paper introduces two novel approaches, Byzantine agreement and threshold coin-tossing, to ensure replica consistency in Byzantine fault-tolerant systems while preserving randomness, addressing security and integrity concerns.
Contribution
It proposes two new methods for maintaining replica integrity and randomness in Byzantine fault-tolerant systems, contrasting with existing deterministic approaches.
Findings
Compared performance of the two approaches
Outlined best use scenarios for each method
Enhanced security and integrity in Byzantine systems
Abstract
Strong replica consistency is often achieved by writing deterministic applications, or by using a variety of mechanisms to render replicas deterministic. There exists a large body of work on how to render replicas deterministic under the benign fault model. However, when replicas can be subject to malicious faults, most of the previous work is no longer effective. Furthermore, the determinism of the replicas is often considered harmful from the security perspective and for many applications, their integrity strongly depends on the randomness of some of their internal operations. This calls for new approaches towards achieving replica consistency while preserving the replica randomness. In this paper, we present two such approaches. One is based on Byzantine agreement and the other on threshold coin-tossing. Each approach has its strength and weaknesses. We compare the performance of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Advanced Data Storage Technologies · Cryptography and Data Security
