Troxy: Transparent Access to Byzantine Fault-Tolerant Systems

Li, Bijun; Weichbrodt, Nico; Behl, Johannes; Aublin, Pierre-Louis; Distler, Tobias; Kapitza, Rüdiger

doi:10.1109/dsn.2018.00019

Cited by 19 publications

(13 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We compare the throughput (Figure 3b) and the latency (Figure 3a measurements show the average of five runs where client and server each exchange 1000 messages. We consider message sizes between 1KB and 100KB: BFT protocols exchange mostly small messages of several kilobytes, only rarely are larger messages necessary, e. g. for HTTP and IMAP use cases as presented in [24]. The measurements show that RDMA Read/Write entails the lowest latency with ≈46 % less compared to RDMA Send/Receive and 53-79 % compared to TCP.…”

Section: Discussionmentioning

confidence: 99%

Towards Low-Latency Byzantine Agreement Protocols Using RDMA

Rüsch

Messadi

Kapitza

2018

2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN-W)

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Discussionmentioning

confidence: 99%

Towards Low-Latency Byzantine Agreement Protocols Using RDMA

Rüsch

Messadi

Kapitza

2018

2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN-W)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Several research efforts aim to support efficient BFT protocols by leveraging the SGX enclaves (e.g., [6,25]). The security primitives provided by the enclaves can reduce the number of replicas and/or communication phases for running BFT protocols.…”

Section: Use Case Analysismentioning

confidence: 99%

Lessons Learned from Blockchain Applications of Trusted Execution Environments and Implications for Future Research

Karanjai¹,

Xu²,

Chen³

et al. 2022

Preprint

View full text Add to dashboard Cite

Modern computer systems tend to rely on large trusted computing bases (TCBs) for operations. To address the TCB bloating problem, hardware vendors have developed mechanisms to enable or facilitate the creation of a trusted execution environment (TEE) in which critical software applications can execute securely in an isolated environment. Even under the circumstance that a host OS is compromised by an adversary, key security properties such as confidentiality and integrity of the software inside the TEEs can be guaranteed. The promise of integrity and security has driven developers to adopt it for use cases involving access control, PKS, IoT among other things. Among these applications include blockchain-related use cases. The usage of the TEEs doesn't come without its own implementation challenges and potential pitfalls. In this paper, we examine the assumptions, security models, and operational environments of the proposed TEE use cases of blockchain-based applications. The exercise and analysis help the hardware TEE research community to identify some open challenges and opportunities for research and rethink the design of hardware TEEs in general.

show abstract

“…SBFT [29] addresses this problem by adding a protocol phase that aggregates request acknowledgements of multiple replicas into a single message to the client. In Troxy [34], a client also has to wait for a single reply only, because the reply voter is hosted inside a trusted domain at the server side and forwards its decisions to the client through a secure channel. In Spider, clients are typically located in the same region as an execution group allowing for communication over short-distance links.…”

Section: Related Workmentioning

confidence: 99%

Resilient Cloud-based Replication with Low Latency

Eischer

Distler

2020

Proceedings of the 21st International Middleware Conference

Self Cite

View full text Add to dashboard Cite

Existing approaches to tolerate Byzantine faults in geo-replicated environments require systems to execute complex agreement protocols over wide-area links and consequently are often associated with high response times. In this paper we address this problem with Spider, a resilient replication architecture for geo-distributed systems that leverages the availability characteristics of today's public-cloud infrastructures to minimize complexity and reduce latency. Spider models a system as a collection of loosely coupled replica groups whose members are hosted in different cloudprovided fault domains (i.e., availability zones) of the same geographic region. This structural organization makes it possible to achieve low response times by placing replica groups in close proximity to clients while still enabling the replicas of a group to interact over short-distance links. To handle the inter-group communication necessary for strong consistency Spider uses a reliable group-to-group message channel with first-in-first-out semantics and built-in flow control that significantly simplifies system design.CCS Concepts: • Computer systems organization → Dependable and fault-tolerant systems and networks.

show abstract

Troxy: Transparent Access to Byzantine Fault-Tolerant Systems

Cited by 19 publications

References 24 publications

Towards Low-Latency Byzantine Agreement Protocols Using RDMA

Towards Low-Latency Byzantine Agreement Protocols Using RDMA

Lessons Learned from Blockchain Applications of Trusted Execution Environments and Implications for Future Research

Resilient Cloud-based Replication with Low Latency

Contact Info

Product

Resources

About