.png){kind=icon}
.png){kind=icon}
Return
Deterministic Causal Order Under Byzantine Sybil Tolerance: Techniques and Limitations
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-11127-2_29.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 < n. Thus, we show corresponding possibility and impossibility results for the highest degree of Byzantine fault-tolerance. We also give the best-known bounds on f for solvability of causal ordering using deterministic algorithms in synchronous systems under the same combinations of system assumptions and parameters as for asynchronous systems.
Keywords:
Byzantine fault-tolerance
Causal Order
Broadcast
Causality
Asynchronous
Message Passing
Journal
S
IF:
0
Papers:
34
Citations:
0
