Transforming Byzantine Faults using a Trusted Execution Environment

Mads Frederik Madsen; Mikkel Gaub; Malthe Ettrup Kirkbro; Søren Debois

doi:10.1109/EDCC.2019.00022

Transforming Byzantine Faults using a Trusted Execution Environment

Mads Frederik Madsen, Mikkel Gaub, Malthe Ettrup Kirkbro, Søren Debois

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

Abstract

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.

Original language	English
Title of host publication	2019 15th European Dependable Computing Conference (EDCC)
Number of pages	8
Publisher	IEEE
Publication date	7 Nov 2019
Pages	63-70
ISBN (Print)	978-1-7281-3930-2
ISBN (Electronic)	978-1-7281-3929-6
DOIs	https://doi.org/10.1109/EDCC.2019.00022
Publication status	Published - 7 Nov 2019

Keywords

Byzantine faults
translation
TEE
TPM
SGX

Access to Document

10.1109/EDCC.2019.00022

Transforming Byzantine Faults using a Trusted Execution EnvironmentAccepted author manuscript, 339 KB

https://ieeexplore.ieee.org/document/8893314

Cite this

@inproceedings{e7e97669d3b340ba892b50df40f05180,

title = "Transforming Byzantine Faults using a Trusted Execution Environment",

abstract = "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.",

keywords = "Byzantine faults, translation, TEE, TPM, SGX, Byzantine faults, translation, TEE, TPM, SGX",

author = "Madsen, {Mads Frederik} and Mikkel Gaub and Kirkbro, {Malthe Ettrup} and S{\o}ren Debois",

year = "2019",

month = nov,

day = "7",

doi = "10.1109/EDCC.2019.00022",

language = "English",

isbn = "978-1-7281-3930-2",

pages = "63--70",

booktitle = "2019 15th European Dependable Computing Conference (EDCC)",

publisher = "IEEE",

address = "United States",

}

TY - GEN

T1 - Transforming Byzantine Faults using a Trusted Execution Environment

AU - Madsen, Mads Frederik

AU - Gaub, Mikkel

AU - Kirkbro, Malthe Ettrup

AU - Debois, Søren

PY - 2019/11/7

Y1 - 2019/11/7

N2 - 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.

AB - 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.

KW - Byzantine faults

KW - translation

KW - TEE

KW - TPM

KW - SGX

KW - Byzantine faults

KW - translation

KW - TEE

KW - TPM

KW - SGX

U2 - 10.1109/EDCC.2019.00022

DO - 10.1109/EDCC.2019.00022

M3 - Article in proceedings

SN - 978-1-7281-3930-2

SP - 63

EP - 70

BT - 2019 15th European Dependable Computing Conference (EDCC)

PB - IEEE

ER -

Transforming Byzantine Faults using a Trusted Execution Environment

Abstract

Keywords

Access to Document

Fingerprint

Cite this