Introduction to Reliable and Secure Distributed Programming

By Christian Cachin, Rachid Guerraoui, Lus Rodrigues. 2011

391 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/861d9e5f5ad9af811b63d7f2c54e3f7ad1d7044f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

All You Need is DAG (2021, methodology): “We use a reliable broadcast [12] abstraction: Each sender process pk can send messages by calling r_bcastk (m, r ), wherem is a message, r ∈ N is a round number.”
Architecture of the Hyperledger Blockchain Fabric (2016, background): “The PBFT protocol [4] has been implemented as the first one in the fabric because of its prominence: it benefits from the experience of almost 20 years of systems-level research on Byzantine consensus, is closely related to well-known protocols like viewstamped replication and Paxos [7], has been an”
Blockchains and Smart Contracts for the Internet of Things (2016, background): “Instead, the bounds indicated in [28] should be used.”
PBFT vs Proof-of-Authority: Applying the CAP Theorem to Permissioned Blockchain (2018, background): “However, the actual consequences of such performance improvement is quite blurry, especially in terms of availability and consistency guarantees in a realistic eventually synchronous network model such as the Internet [5]).”
ROTE: Rollback Protection for Trusted Execution (2017, background): “The main components of our solution are a state update mechanism that is an optimized version of consistent broadcast protocols [15, 16], and a recovery mechanism that obtains lost counters from the rest of the protection group upon enclave restart.”
Asynchronous Byzantine Machine Learning (2018, background): “Byzantine workers can furthermore collude, as typically assumed in the distributed computing literature (Lamport et al., 1982; Lynch, 1996; Cachin et al., 2011).”
Blockchain Consensus Protocols in the Wild (2017, methodology): “It is now possible that in a network with nodes A, B, C, D the current leader D is faulty and causes A to deliver and commit some payload m [18, Fig.”
Narwhal and Tusk: a DAG-based mempool and efficient BFT consensus (2021, methodology): “5The properties of reliable broadcast are Validity, No duplication, Integrity, Consistency, and Totality (see page 112 and 117 of [18]).”
SoK: Consensus in the Age of Blockchains (2017, background): “. The surveyed literature comprised of wellknown seminal works in the area, based on their inﬂuence and subsequent citations. It was also supported by Cachin et al.’s comprehensive book on this topic [38] and Schneider’s classical survey on state machine replication [121]. B. Consensus in Blockchain”