Worm-IT – A wormhole-based intrusion-tolerant group communication system

Correia, Miguel; Neves, Nuno; Lung, Lau Cheuk; Verı́ssimo, Paulo

doi:10.1016/j.jss.2006.03.034

Cited by 23 publications

(8 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There exists a number of general-purpose Byzantine fault tolerance algorithms/protocols [1], [2], [7], [8], [9], [10], [16], [23], [33], and group communication systems that handle Byzantine faults [12], [15], [24], [28]. Although they can be readily used to ensure BFT transaction coordination for WS-AT, they would incur unacceptable overhead if they were used naively, as shown in this paper.…”

Section: Related Workmentioning

confidence: 99%

Trustworthy Coordination of Web Services Atomic Transactions

Zhang

Chai

Zhao

et al. 2012

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-The Web Services Atomic Transactions (WS-AT) specification makes it possible for businesses to engage in standard distributed transaction processing over the Internet using Web Services technology. For such business applications, trustworthy coordination of WS-AT is crucial. In this paper, we explain how to render WS-AT coordination trustworthy by applying Byzantine Fault Tolerance (BFT) techniques. More specifically, we show how to protect the core services described in the WS-AT specification, namely, the Activation service, the Registration service, the Completion service and the Coordinator service, against Byzantine faults. The main contribution of this work is that it exploits the semantics of the WS-AT services to minimize the use of Byzantine Agreement (BA), instead of applying BFT techniques naively, which would be prohibitively expensive. We have incorporated our BFT protocols and mechanisms into an open-source framework that implements the WS-AT specification. The resulting BFT framework for WS-AT is useful for business applications that are based on WS-AT and that require a high degree of dependability, security, and trust.

show abstract

Section: Related Workmentioning

confidence: 99%

Trustworthy Coordination of Web Services Atomic Transactions

Zhang

Chai

Zhao

et al. 2012

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…SecureGroup is based on a family of randomized atomic multicast protocols. We presented a fourth group communication system called Worm-IT [69]. That system is based on an earlier wormhole, the Trusted Timely Computing Base (TTCB) that provides several services, instead of the single service of the TO wormhole.…”

Section: Related Workmentioning

confidence: 99%

BFT-TO: Intrusion Tolerance with Less Replicas

Correia

Neves

Verı́ssimo

2012

The Computer Journal

View full text Add to dashboard Cite

State machine replication (SMR) is a generic technique for implementing fault-tolerant distributed services by replicating them in sets of servers. There have been several proposals for using SMR to tolerate arbitrary or Byzantine faults, including intrusions. However, most of these systems can tolerate at most f faulty servers out of a total of 3f + 1. We show that it is possible to implement a Byzantine SMR algorithm with only 2f + 1 replicas by extending the system with a simple trusted distributed component. Several performance metrics show that our algorithm, BFT-TO, fares well in comparison with others in the literature. Furthermore, BFT-TO is not vulnerable to some recently presented performance attacks that affect alternative approaches.

show abstract

“…The view can be modified by events like the addition of members to a group, the removal of failed members, and the removal of members by their own initiative. The Byzantine-resilient membership algorithms available give this intuition that a transformation might be defined (Reiter, 1996;Kihlstrom et al, 2001;Correia et al, 2007).…”

Section: Related and Equivalent Problemsmentioning

confidence: 99%

Byzantine consensus in asynchronous message-passing systems: a survey

Correia

Veronese

Neves

et al. 2011

IJCCBS

Self Cite

View full text Add to dashboard Cite

Consensus is a classical distributed systems problem with both theoretical and practical interest. Asynchronous Byzantine consensus is currently at the core of some solutions for the implementation of highlyresilient computing services. This paper surveys Byzantine consensus in message-passing distributed systems, by presenting the main theoretical results in the area, the main classes of algorithms and by discussing important issues like the performance and resilience of these algorithms.

show abstract

Worm-IT – A wormhole-based intrusion-tolerant group communication system

Cited by 23 publications

References 44 publications

Trustworthy Coordination of Web Services Atomic Transactions

Trustworthy Coordination of Web Services Atomic Transactions

BFT-TO: Intrusion Tolerance with Less Replicas

Byzantine consensus in asynchronous message-passing systems: a survey

Contact Info

Product

Resources

About