M. Leinweber

activity

20182025

most citedLet It TEE: Asynchronous Byzantine Atomic Broadcast with

n \geq 2 f + 1

2 citations · 2 across the 2 of their papers we have counts for

collaborators

Showing cs.DCShow all

2 papers · 1 filter

cs.DC2025

Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication

Marc Leinweber, Hannes Hartenstein

We propose, implement, and evaluate NxBFT, a resilient and efficient State Machine Replication protocol using Trusted Execution Environments (TEEs). NxBFT focuses on a "Not eXactly…

cs.DC2023★ 2 cited

Let It TEE: Asynchronous Byzantine Atomic Broadcast with $n \geq 2 f + 1$

Marc Leinweber, Hannes Hartenstein

Asynchronous Byzantine Atomic Broadcast (ABAB) promises simplicity in implementation as well as increased performance and robustness in comparison to partially synchronous approach…

Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication

Let It TEE: Asynchronous Byzantine Atomic Broadcast with n≥2f+1

Let It TEE: Asynchronous Byzantine Atomic Broadcast with $n \geq 2 f + 1$