We present a general transformation of general omission resilient distributed algorithms into byzantine fault ones. The transformation uses the guarantees of integrity and confidentiality provided by a trusted execution environment to implement a byzantine failure detector. Correct processes in a transformed algorithm will operate as if byzantine faulty processes have crashed or their messages were dropped. The transformation adds no additional messages between processes, except for a pre-compute step, and the increase in states of the algorithm is linearly bounded: it is a 1-round, n=f+1 translation, making no assumptions of determinism.
|Title of host publication||2019 15th European Dependable Computing Conference (EDCC)|
|Number of pages||8|
|Publication date||7 Nov 2019|
|Publication status||Published - 7 Nov 2019|
- Byzantine faults