Consensus Crash Testing: Exploring Ripple’s Decentralization Degree in Adversarial Environments

作者: Klitos Christodoulou , Elias Iosif , Antonios Inglezakis , Marinos Themistocleous

DOI: 10.3390/FI12030053

关键词:

摘要: The inception of Bitcoin as a peer-to-peer payment system, and its underlying blockchain data-structure protocol, has led to an increased interest in deploying scalable reliable distributed-ledger systems that build on robust consensus protocols. A critical requirement such is provide enough fault tolerance the presence adversarial attacks or network faults. This essential guarantee liveness when does not behave expected ensure nodes agree unique order transactions over shared state. In comparison with traditional distributed systems, deployment system should take into account hidden game theoretical aspects protocols, where actors are competing each other environment which likely experience various well-motivated malicious attacks. Firstly, this paper discusses fundamental principles existing protocols context both permissioned permissionless systems. main contribution work deals observations from experimenting Ripple’s protocol it embodied XRP Ledger. experimental finding suggests that, low percentage present, centralization degree can be significantly relaxed ensuring convergence times. Those findings particular importance engineering algorithm would like balance security decentralization.

参考文章(26)
N. Boris Margolin, Brian Neil Levine, Clay Shields, A Survey of Solutions to the Sybil Attack ,(2006)
Michael J. Fischer, The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) fundamentals of computation theory. pp. 127- 140 ,(1983) , 10.1007/3-540-12689-9_99
Christian Decker, Jochen Seidel, Roger Wattenhofer, Bitcoin meets strong consistency international conference of distributed computing and networking. pp. 13- ,(2016) , 10.1145/2833312.2833321
J. Turek, D. Shasha, The many faces of consensus in distributed systems IEEE Computer. ,vol. 25, pp. 8- 17 ,(1992) , 10.1109/2.153253
Leslie Lamport, Lower bounds for asynchronous consensus Distributed Computing. ,vol. 19, pp. 104- 125 ,(2006) , 10.1007/S00446-006-0155-X
Lorenzo Alvisi, Dahlia Malkhi, Evelyn Pierce, Michael K. Reiter, None, Fault detection for Byzantine quorum systems IEEE Transactions on Parallel and Distributed Systems. ,vol. 12, pp. 996- 1007 ,(2001) , 10.1109/71.954640
J. Sousa, A. Bessani, From Byzantine Consensus to BFT State Machine Replication: A Latency-Optimal Transformation european dependable computing conference. pp. 37- 48 ,(2012) , 10.1109/EDCC.2012.32
Alysson Bessani, Joao Sousa, Eduardo E.P. Alchieri, State Machine Replication for the Masses with BFT-SMART dependable systems and networks. pp. 355- 362 ,(2014) , 10.1109/DSN.2014.43
Eduardo A. P. Alchieri, Alysson Neves Bessani, Joni da Silva Fraga, Fabíola Greve, Byzantine Consensus with Unknown Participants international conference on principles of distributed systems. pp. 22- 40 ,(2008) , 10.1007/978-3-540-92221-6_4
John Augustine, Gopal Pandurangan, Peter Robinson, Fast byzantine agreement in dynamic networks principles of distributed computing. pp. 74- 83 ,(2013) , 10.1145/2484239.2484275