Deterministic Causal Order Under Byzantine Sybil Tolerance: Techniques and Limitations
摘要
A spectrum of solvability and unsolvability results for causal ordering of messages in the presence of Byzantine processes in asynchronous systems for unicast, multicast, and broadcast modes of communication have been shown. The possibility results implicitly assumed that the number of Byzantine processes f was less than n/3, where n is the total number of processes in the system. In this paper, we extend these results for the same system assumptions and parameters – mode of communication (unicast/broadcast/multicast), strong safety, weak safety, and liveness, and use of cryptography, to systems with $$f