Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions

DOI10.1145/1281100.1281147MaRDI QIDQ5401428zbMATH OpenOpenAlexFDO

Authors Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1281100.1281147

zbMATH Keywords

replicationfault toleranceboundedwait-freeByzantineatomicinformation theoretic

Mathematics Subject Classification ID

Cryptography (94A60) Distributed systems (68M14) Network protocols (68M12)

Recommendations

• Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions
• Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients
• Wait-free regular storage from Byzantine components
• Simple and efficient asynchronous Byzantine agreement with optimal resilience
• Asynchronous Byzantine agreement with optimal resilience
• A protocol for implementing Byzantine storage in churn-prone distributed systems
• Byzantine agreement in polynomial time with near-optimal resilience
• Proofs of replicated storage without timing assumptions
• Byzantine disk paxos: optimal resilience with Byzantine shared memory

Cited in

(9)

• Remote storage with Byzantine servers
• A protocol for implementing Byzantine storage in churn-prone distributed systems
• Integrated bounds for disintegrated storage
• Wait-free regular storage from Byzantine components
• Exploring key-value stores in multi-writer Byzantine-resilient register emulations
• Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients
• Amnesic Distributed Storage
• Byzantine disk paxos
• Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions

This page was built for publication: Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions

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