Guy Goren
ABSTRACT
In reliable settings, null messages allow the transfer of information without explicit communication in cases of interest. We investigate the use of null messages in the much more challenging Byzantine model (without signatures). Different ways of using null messages are discussed. One of them, called a silent validation round, can provide processes with global information about all correct sites of the system, without any message exchange. As a case study, we consider optimizing the behavior in failure-free runs of protocols for the classic Byzantine Consensus problem.
- Eugene S Amdur, Samuel M Weber, and Vassos Hadzilacos. 1992. On the message complexity of binary byzantine agreement under crash failures. Distributed Computing 5, 4 (1992), 175--186.Google Scholar
Digital Library
- Piotr Berman, Juan A Garay, and Kenneth J Perry. 1992. Optimal early stopping in distributed consensus. In International Workshop on Distributed Algorithms. Springer, 221--237.Google ScholarCross Ref
- KM Chandy and Jayadev Misra. 1986. How processes learn. Distributed Computing 1, 1 (1986), 40--52.Google ScholarDigital Library
- Gregory Chockler, Murat Demirbas, Seth Gilbert, Nancy Lynch, Calvin Newport, and Tina Nolte. 2008. Consensus and collision detectors in radio networks. Distributed Computing 21, 1 (2008), 55--84.Google ScholarDigital Library
- Danny Dolev and Rüdiger Reischuk. 1985. Bounds on information exchange for Byzantine agreement. Journal of the ACM (JACM) 32, 1 (1985), 191--204.Google ScholarDigital Library
- Danny Dolev and H. Raymond Strong. 1983. Authenticated algorithms for Byzantine agreement. SIAM J. Comput. 12, 4 (1983), 656--666.Google ScholarDigital Library
- Seth Gilbert, Rachid Guerraoui, and Calvin Newport. 2009. Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks. Theoretical Computer Science 410, 6-7 (2009), 546--569.Google ScholarDigital Library
- Guy Goren and Yoram Moses. 2018. Silence. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (PODC '18). ACM, New York, NY, USA, 285--294. Google ScholarDigital Library
- Rachid Guerraoui and Jingjing Wang. 2017. How fast can a distributed transaction commit?. In Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. ACM, 107--122.Google ScholarDigital Library
- Vassos Hadzilacos and Joseph Y Halpern. 1993. Message-optimal protocols for Byzantine agreement. Mathematical Systems Theory 26, 1 (1993), 41--102.Google ScholarCross Ref
- Leslie Lamport. 1978. Time, Clocks, and the Ordering of Events in a Distributed System. Communications (1978).Google Scholar
- Leslie Lamport. 1984. Using time instead of timeout for fault-tolerant distributed systems. ACM Transactions on Programming Languages and Systems (TOPLAS) 6, 2 (1984), 254--280.Google ScholarDigital Library
- Russell Turpin and Brian A Coan. 1984. Extending binary Byzantine agreement to multivalued Byzantine agreement. Inform. Process. Lett. 18, 2 (1984), 73--76.Google ScholarCross Ref
Index Terms
- Brief Announcement: On Using Null Messages in a Byzantine Setting
Recommendations
Optimistically tuning synchronous byzantine consensus: another win for null messages
AbstractModular methods that transform Byzantine consensus protocols for the synchronous model into ones that are fast and communication efficient in failure-free executions are presented. Small and short protocol segments called layers are custom ...
Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
AbstractWe study a well-known communication abstraction called Byzantine Reliable Broadcast (BRB). This abstraction is central in the design and implementation of fault-tolerant distributed systems, as many fault-tolerant distributed ...
Brief Announcement: Relaxed Byzantine Vector Consensus
SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and ArchitecturesByzantine vector consensus requires that non-faulty processes reach agreement on a decision (or output) that is in the convex hull of the inputs at the non-faulty processes. Recent work has shown that, for n processes with up to f Byzantine failures, ...
Comments