Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients

DOI10.1007/11864219_21MaRDI QIDQ3524313zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

atomicByzantinefault tolerancereplicationtimestampswait-free

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

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

Cited in

(7)

• Stabilizing server-based storage in Byzantine asynchronous message-passing systems (extended abstract)
• The complexity of robust atomic storage
• Exploring key-value stores in multi-writer Byzantine-resilient register emulations
• Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions
• scientific article; zbMATH DE number 2013839 (Why is no real title available?)
• Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions
• Remote storage with Byzantine servers

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)