Hardening Cassandra against Byzantine failures

DOI10.4230/LIPICS.OPODIS.2017.27zbMATH Open1487.68044arXiv1610.02885MaRDI QIDQ3300830FDOQ3300830

Authors: Roy Friedman, Roni Licher 

Publication date: 30 July 2020

Full work available at URL: https://arxiv.org/abs/1610.02885

Recommendations

• Distributed Computing
• Byzantine quorum systems
• scientific article; zbMATH DE number 1559572
• Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions
• Synchronous Byzantine quorum systems

zbMATH Keywords

Byzantine fault tolerancedistributed storageCassandra

Mathematics Subject Classification ID

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

Cites Work

• A method for obtaining digital signatures and public-key cryptosystems
• Byzantine quorum systems
• Time, clocks, and the ordering of events in a distributed system
• The Byzantine Generals Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Brahms: Byzantine resilient random membership sampling
• Distributed Computing

Cited In (1)

• Statically defend network consumption against acker failure vulnerability in storm

Uses Software

• Cassandra
• Bigtable
• Dynamo

This page was built for publication: Hardening Cassandra against Byzantine failures

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