Hardening Cassandra against Byzantine failures

DOI10.4230/LIPICS.OPODIS.2017.27MaRDI QIDQ3300830zbMATH OpenFDO

Authors Roy Friedman, Roni Licher

Publication date 30 July 2020

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

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)

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

Cites work

• scientific article; zbMATH DE number 1931811 (Why is no real title available?)
• scientific article; zbMATH DE number 1931812 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems
• Brahms: Byzantine resilient random membership sampling
• Byzantine quorum systems
• Distributed Computing
• The Byzantine Generals Problem
• Time, clocks, and the ordering of events in a distributed system

Cited in

(1)

• Statically defend network consumption against acker failure vulnerability in storm

Describes a project that uses

Uses Software

• Dynamo
• Bigtable
• Cassandra

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)