Instruct: Given a paper title, retrieve paper titles that are cited by the given paper.
Query: Revisiting Fast Practical Byzantine Fault Tolerance
Practical byzantine fault tolerance
Algorand: Scaling Byzantine Agreements for Cryptocurrencies
HoneyLedgerBFT : Enabling Byzantine Fault Tolerance for the Hyperledger platform
Canopus: A Scalable and Massively Parallel Consensus Protocol
Flexible Paxos: Quorum intersection revisited
Paxos Quorum Leases: Fast Reads Without Sacrificing Writes
Optimizing Paxos with batching and pipelining
HAFT: hardware-assisted fault tolerance
Impossibility of distributed consensus with one faulty process
Randomized Protocols for Asynchronous Consensus
Federated Byzantine Agreement to Ensure Trustworthiness of Digital Manufacturing Platforms
Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus
Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
Generalized Consensus and Paxos
Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards
Paxos Made Simple
Bicomp: A Bilayer Scalable Nakamoto Consensus Protocol
A Proof of Correctness for Egalitarian Paxos
Hot-Stuff the Linear, Optimal-Resilience, One-Message BFT Devil.
XX : 2 Solida : A Cryptocurrency Based on Reconfigurable Byzantine Consensus
Exploiting Social Information in Pairwise Preference Recommender System
Developmental Readiness for Leadership: The Differential Effects of Leadership Courses on Creating “Ready, Willing, and Able” Leaders
General composition and universal composability in secure multi-party computation
Distributed Machine Learning in Coalition Environments: Overview of Techniques
Mencius: Building Efficient Replicated State Machine for WANs