Wait-free regular storage from Byzantine components

DOI10.1016/J.IPL.2006.07.012MaRDI QIDQ845896zbMATH OpenOpenAlexFDO

Authors Ittai Abraham, Gregory Chockler, Idit Keidar, Dahlia Malkhi

Publication date 29 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2006.07.012

zbMATH Keywords

distributed computing

Mathematics Subject Classification ID

Distributed systems (68M14)

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
• A protocol for implementing Byzantine storage in churn-prone distributed systems
• Stabilizing server-based storage in Byzantine asynchronous message-passing systems (extended abstract)
• Proofs of replicated storage without timing assumptions
• Resource-Efficient Byzantine Fault Tolerance
• Remote storage with Byzantine servers
• Coordination-Free Byzantine Replication with Minimal Communication Costs
• Self-stabilizing Byzantine asynchronous unison

Cites work

• scientific article; zbMATH DE number 2013839 (Why is no real title available?)
• Bounded concurrent timestamp systems using vector clocks
• Byzantine disk paxos: optimal resilience with Byzantine shared memory
• Byzantine quorum systems
• Concurrent Reading While Writing
• Concurrent reading while writing revisited
• Disk paxos
• Fault-tolerant wait-free shared objects
• Multi-writer consistency conditions for shared memory objects
• On interprocess communication. II: Algorithms

Cited in

(9)

• Active disk Paxos with infinitely many processes
• A protocol for implementing Byzantine storage in churn-prone distributed systems
• Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions
• Integrated bounds for disintegrated storage
• Exploring key-value stores in multi-writer Byzantine-resilient register emulations
• Dynamic atomic storage without consensus
• Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients
• Amnesic Distributed Storage
• Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions

This page was built for publication: Wait-free regular storage from Byzantine components

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845896)