Probabilistic Byzantine Tolerance for Cloud Computing

Abstract : Preventing Byzantine failures in the context of cloud computing is costly. Traditional BFT protocols induce a fixed degree of replication for computations and are therefore wasteful. This paper explores probabilistic Byzantine tolerance, in which computation tasks are replicated on dynamic replication sets whose size is determined based on ensuring probabilistic thresholds of correctness. The probabilistic assessment of a trustworthy output by selecting reputable nodes allows a significant reduction in the number of nodes involved in each computation task. The paper further studies several reputation management policies, including the one used by BOINC as well as a couple of novel ones, in terms of their impact of the possible damage inflicted on the system by various Byzantine behavior strategies, and reports some encouraging insights.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.sorbonne-universite.fr/hal-01166767
Contributor : Olivier Marin <>
Submitted on : Tuesday, June 23, 2015 - 10:56:10 AM
Last modification on : Thursday, March 21, 2019 - 2:30:57 PM

Identifiers

Citation

Luciana Arantes, Roy Friedman, Olivier Marin, Pierre Sens. Probabilistic Byzantine Tolerance for Cloud Computing. 34th International Symposium on Reliable Distributed Systems (SRDS 2015), Sep 2015, Montreal, Canada. pp.1-10, ⟨10.1109/SRDS.2015.22⟩. ⟨hal-01166767⟩

Share

Metrics

Record views

215