Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients
From MaRDI portal
Publication:3524313
DOI10.1007/11864219_21zbMATH Open1155.68323OpenAlexW1868640745MaRDI QIDQ3524313FDOQ3524313
Authors: Yin Ding, Rida A. Bazzi 
Publication date: 9 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11864219_21
Recommendations
- Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions
- Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions
- Stabilizing server-based storage in Byzantine asynchronous message-passing systems (extended abstract)
- Remote storage with Byzantine servers
- Wait-free regular storage from Byzantine components
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)
Cited In (7)
- Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions
- Remote storage with Byzantine servers
- Exploring key-value stores in multi-writer Byzantine-resilient register emulations
- Stabilizing server-based storage in Byzantine asynchronous message-passing systems (extended abstract)
- Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions
- The complexity of robust atomic storage
- Title not available (Why is that?)
This page was built for publication: Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524313)
