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

DOI10.1145/1281100.1281147zbMath1283.68074OpenAlexW2089497584MaRDI QIDQ5401428

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

fault tolerancereplicationboundedwait-freeByzantineatomicinformation theoretic

Mathematics Subject Classification ID

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

Related Items (1)

A protocol for implementing Byzantine storage in churn-prone distributed systems

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