Bft in blockchains: From protocols to use cases
A blockchain is a distributed system that achieves strong security guarantees in storing,
managing, and processing data. All blockchains achieve a common goal: building a …
managing, and processing data. All blockchains achieve a common goal: building a …
QuePaxa: Esca** the tyranny of timeouts in consensus
Leader-based consensus algorithms are fast and efficient under normal conditions, but lack
robustness to adverse conditions due to their reliance on timeouts for liveness. We present …
robustness to adverse conditions due to their reliance on timeouts for liveness. We present …
Poligraph: Intrusion-tolerant and distributed fake news detection system
We present Poligraph, an intrusion-tolerant and decentralized fake news detection system.
Poligraph aims to address architectural, system, technical, and social challenges of building …
Poligraph aims to address architectural, system, technical, and social challenges of building …
RACS and SADL: Towards Robust SMR in the Wide-Area Network
Consensus algorithms deployed in the crash fault tolerant setting chose a leader-based
architecture in order to achieve the lowest latency possible. However, when deployed in the …
architecture in order to achieve the lowest latency possible. However, when deployed in the …
Baxos: Backing off for robust and efficient consensus
Leader-based consensus algorithms are vulnerable to liveness and performance
downgrade attacks. We explore the possibility of replacing leader election in Multi-Paxos …
downgrade attacks. We explore the possibility of replacing leader election in Multi-Paxos …
Mandator and Sporades: Robust wide-area consensus with efficient request dissemination
P Tennage, A Desjardins, EK Kogias - arxiv preprint arxiv:2209.06152, 2022 - arxiv.org
Consensus algorithms are deployed in the wide area to achieve high availability for
geographically replicated applications. Wide-area consensus is challenging due to two main …
geographically replicated applications. Wide-area consensus is challenging due to two main …
Cost sensitive moving target consensus
S Duan, Y Li, K Levitt - 2016 IEEE 15th International …, 2016 - ieeexplore.ieee.org
Consensus is a fundamental approach to implementing fault-tolerant services through
replication. It is well known that there exists a tradeoff between the cost and the resilience …
replication. It is well known that there exists a tradeoff between the cost and the resilience …
Moving participants turtle consensus
S Nikolaou, R van Renesse - arxiv preprint arxiv:1611.03562, 2016 - arxiv.org
We present Moving Participants Turtle Consensus (MPTC), an asynchronous consensus
protocol for crash and Byzantine-tolerant distributed systems. MPTC uses various moving …
protocol for crash and Byzantine-tolerant distributed systems. MPTC uses various moving …
A secure hash commitment approach for moving target defense of security-critical services
D Mulamba, A Amarnath, B Bezawada… - Proceedings of the 5th …, 2018 - dl.acm.org
Protection of security-critical services, such as access-control reference monitors, is an
important requirement in the modern era of distributed systems and services. The threat …
important requirement in the modern era of distributed systems and services. The threat …
BFT Baxos: Robust and Efficient BFT Consensus using Random Backoff
Z Cui - 2024 - diva-portal.org
BFT consensus algorithms can ensure the consistency of distributed systems where nodes
may behave arbitrarily due to faults or intentional malicious actions. However, most of the …
may behave arbitrarily due to faults or intentional malicious actions. However, most of the …