Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions

DOI10.1007/978-3-540-75142-7_4zbMath1145.68340OpenAlexW1780994957MaRDI QIDQ3523195

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

Publication date: 2 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75142-7_4

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (1)

Refined quorum systems

This page was built for publication: Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions