Skip to Main content Skip to Navigation
Conference papers

Improving Independence of Failures in BFT

Abstract : Independence of failures is a basic assumption for the correctness of BFT protocols. In literature, this subject was addressed by providing N-version like abstractions. Though this can provide a good level of obfuscation against semantic- based attacks, if the replicas know each others identities then non-semantic attacks like DoS can still compromise all replicas together. In this paper, we address the obfuscation problem in a different way by keeping replicas unaware of each other. This makes it harder for attackers to sneak from one replica to another and reduces the impact of simultaneous attacks on all replicas. For this sake, we present a new obfuscated BFT protocol, called OBFT, where the replicas remain unaware of each other by exchanging their messages through the clients. Thus, OBFT assumes honest, but possibly crash-prone clients. We show that obfuscation in our context could not be achieved without this assumption, and we give possible applications where this assumption can be accepted. We evaluated our protocol on an Emulab cluster with a wide area topology. Our experiments show that the scalability and throughput of OBFT remain comparable to existing BFT protocols despite the obfuscation overhead.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Wednesday, December 9, 2015 - 2:30:08 PM
Last modification on : Tuesday, June 16, 2020 - 8:24:11 AM
Long-term archiving on: : Thursday, March 10, 2016 - 2:17:58 PM


Files produced by the author(s)


  • HAL Id : hal-01240714, version 1
  • OATAO : 12525


Ali Shoker, Jean-Paul Bahsoun, Maysam Yabandeh. Improving Independence of Failures in BFT. 12th IEEE International Symposium on Network Computing and Applications (NCA 2013), Aug 2013, Cambridge, MA, United States. pp.227-234. ⟨hal-01240714⟩



Record views


Files downloads