Document Open Access Logo

FairLedger: A Fair Blockchain Protocol for Financial Institutions

Authors Kfir Lev-Ari, Alexander Spiegelman, Idit Keidar, Dahlia Malkhi



PDF
Thumbnail PDF

File

LIPIcs.OPODIS.2019.4.pdf
  • Filesize: 0.57 MB
  • 17 pages

Document Identifiers

Author Details

Kfir Lev-Ari
  • Technion IIT, Haifa, Israel
Alexander Spiegelman
  • VMware Research, Herzliya, Israel
Idit Keidar
  • Technion IIT, Haifa, Israel
Dahlia Malkhi
  • Calibra, Menlo Park, CA, USA

Cite AsGet BibTex

Kfir Lev-Ari, Alexander Spiegelman, Idit Keidar, and Dahlia Malkhi. FairLedger: A Fair Blockchain Protocol for Financial Institutions. In 23rd International Conference on Principles of Distributed Systems (OPODIS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 153, pp. 4:1-4:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.OPODIS.2019.4

Abstract

Financial institutions nowadays are looking into technologies for permissioned blockchains. A major effort in this direction is Hyperledger, an open source project hosted by the Linux Foundation and backed by a consortium of over a hundred companies. A key component in permissioned blockchain protocols is a byzantine fault tolerant (BFT) consensus engine that orders transactions. However, currently available BFT solutions in Hyperledger (as well as in the literature at large) are inadequate for financial settings; they are not designed to ensure fairness or to tolerate the selfish behavior that inevitably arises when financial institutions strive to maximize their own profit. We present FairLedger, a permissioned BFT blockchain protocol, which is fair, deigned to deal with rational behavior, and, no less important, easy to understand and implement. Our secret sauce is a new communication abstraction called detectable all-to-all (DA2A), which allows us to detect players (byzantine or rational) that deviate from the protocol and punish them. We implement FairLedger in the Hyperledger open source project using the Iroha framework - one of the biggest projects therein. To evaluate FairLegder’s performance, we also implement it in the PBFT framework and compare the two protocols. Our results show that in failure-free scenarios in wide-area settings, FairLedger achieves better throughput than both Iroha’s implementation and PBFT.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • Blockchain
  • Fairness
  • Byzantine fault tolerance
  • Rational players
  • Equilibrium

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Michael Abd-El-Malek, Gregory R Ganger, Garth R Goodson, Michael K Reiter, and Jay J Wylie. Fault-scalable Byzantine fault-tolerant services. In Operating Systems Review, 2005. Google Scholar
  2. Ittai Abraham, Lorenzo Alvisi, and Joseph Y Halpern. Distributed computing meets game theory: combining insights from two fields. Acm Sigact News, 2011. Google Scholar
  3. Ittai Abraham, Danny Dolev, and Joseph Y Halpern. Distributed protocols for leader election: A game-theoretic perspective. In International Symposium on Distributed Computing, 2013. Google Scholar
  4. Ittai Abraham and Dahlia Malkhi. BVP: Byzantine Vertical Paxos, 2016. Google Scholar
  5. Amitanand S Aiyer, Lorenzo Alvisi, Allen Clement, Mike Dahlin, Jean-Philippe Martin, and Carl Porth. BAR fault tolerance for cooperative services. In operating systems review, 2005. Google Scholar
  6. Yair Amir, Brian Coan, Jonathan Kirsch, and John Lane. Customizable fault tolerance forwide-area replication. In Reliable Distributed Systems, 2007. SRDS 2007., 2007. Google Scholar
  7. Yair Amir, Brian Coan, Jonathan Kirsch, and John Lane. Prime: Byzantine replication under attack. IEEE Transactions on Dependable and Secure Computing, 2011. Google Scholar
  8. Yair Amir, Claudiu Danilov, Jonathan Kirsch, John Lane, Danny Dolev, Cristina Nita-Rotaru, Josh Olsen, and David Zage. Scaling byzantine fault-tolerant replication towide area networks. In Dependable Systems and Networks, 2006. DSN 2006, 2006. Google Scholar
  9. Avi Asayag, Gad Cohen, Ido Grayevsky, Maya Leshkowitz, Ori Rottenstreich, Ronen Tamari, and David Yakira. A Fair Consensus Protocol for Transaction Ordering. In A Fair Consensus Protocol for Transaction Ordering, pages 55-65, 2018. URL: https://doi.org/10.1109/ICNP.2018.00016.
  10. Michael Ben-Or, Boaz Kelmer, and Tal Rabin. Asynchronous secure computations with optimal resilience. In PODC. ACM, 1994. Google Scholar
  11. Gabriel Bracha. Asynchronous Byzantine agreement protocols. Information and Computation, 1987. Google Scholar
  12. Gabriel Bracha and Sam Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM (JACM), 1985. Google Scholar
  13. Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. Secure and efficient asynchronous broadcast protocols. In Cryptology. Springer, 2001. Google Scholar
  14. Christian Cachin and Stefano Tessaro. Asynchronous verifiable information dispersal. In Reliable Distributed Systems, 2005. SRDS 2005. 24th IEEE Symposium on. IEEE, 2005. Google Scholar
  15. Ran Canetti and Tal Rabin. Fast asynchronous Byzantine agreement with optimal resilience. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, 1993. Google Scholar
  16. Miguel Castro, Barbara Liskov, et al. Practical Byzantine fault tolerance. In OSDI, 1999. Google Scholar
  17. Miguel Castro, Barbara Liskov, et al. BFT - Practical Byzantine Fault Tolerance (software). http://www.pmg.csail.mit.edu/bft/#sw, 2017. [Online; accessed 16-Apr-2017].
  18. Allen Clement, Edmund L Wong, Lorenzo Alvisi, Michael Dahlin, and Mirco Marchetti. Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults. In NSDI, 2009. Google Scholar
  19. CoreOS. etcd - a highly-available key value store for shared configuration and service discovery. https://coreos.com/etcd/, 2017.
  20. Flaviu Cristian, Houtan Aghili, Raymond Strong, and Danny Dolev. Atomic broadcast: From simple message diffusion to Byzantine agreement. Citeseer, 1986. Google Scholar
  21. Danny Dolev and H. Raymond Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing, 12(4):656-666, 1983. Google Scholar
  22. Vadim Drabkin, Roy Friedman, and Alon Kama. Practical Byzantine group communication. In ICDCS. IEEE, 2006. Google Scholar
  23. Sisi Duan, Hein Meling, Sean Peisert, and Haibin Zhang. BChain: Byzantine Replication with High Throughput and Embedded Reconfiguration. In OPODIS 2014. OPODIS 2014, 2014. Google Scholar
  24. Joan Feigenbaum, Christos Papadimitriou, and Scott Shenker. Sharing the cost of muliticast transmissions (preliminary version). In Theory of computing. ACM, 2000. Google Scholar
  25. Michal Feldman, Christos Papadimitriou, John Chuang, and Ion Stoica. Free-riding and whitewashing in peer-to-peer systems. Journal on Selected Areas in Communications, 2006. Google Scholar
  26. Michael J Fischer, Nancy A Lynch, and Michael Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1(1):26-39, 1986. Google Scholar
  27. Matthias Fitzi and Martin Hirt. Optimally efficient multi-valued byzantine agreement. In PODC. ACM, 2006. Google Scholar
  28. The Linux Foundation. Hyperledger. URL: https://www.hyperledger.org/.
  29. Google. Protocol Buffers - data interchange format. URL: https://github.com/google/protobuf.
  30. Google. GRPC - Open-source universal RPC framework. http://www.grpc.io/, 2017.
  31. Patrick Hunt, Mahadev Konar, Flavio Paiva Junqueira, and Benjamin Reed. ZooKeeper: Wait-free Coordination for Internet-scale Systems. In USENIX technical conference, 2010. Google Scholar
  32. Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, and Edmund Wong. Zyzzyva: speculative byzantine fault tolerance. In ACM SIGOPS Operating Systems Review, 2007. Google Scholar
  33. Leslie Lamport, Dahlia Malkhi, and Lidong Zhou. Vertical paxos and primary-backup replication. In PODC. ACM, 2009. Google Scholar
  34. Leslie Lamport, Robert Shostak, and Marshall Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):382-401, 1982. Google Scholar
  35. Kfir Lev-Ari, Alexander Spiegelman, Idit Keidar, and Dahlia Malkhi. FairLedger: A Fair Blockchain Protocol for Financial Institutions. arXiv preprint arXiv:1906.03819, 2019. Google Scholar
  36. Harry C Li, Allen Clement, Edmund L Wong, Jeff Napper, Indrajit Roy, Lorenzo Alvisi, and Michael Dahlin. BAR gossip. In Operating systems design and implementation, 2006. Google Scholar
  37. Jinyuan Li and David Maziéres. Beyond One-Third Faulty Replicas in Byzantine Fault Tolerant Systems. In NSDI, 2007. Google Scholar
  38. Shengyun Liu, Christian Cachin, Vivien Quéma, and Marko Vukolic. XFT: practical fault tolerance beyond crashes. CoRR, abs/1502.05831, 2015. Google Scholar
  39. J-P Martin and Lorenzo Alvisi. Fast byzantine consensus. IEEE Transactions on Dependable and Secure Computing, 3(3):202-215, 2006. Google Scholar
  40. Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, and Dawn Song. The honey badger of BFT protocols. In CCS. ACM, 2016. Google Scholar
  41. Thomas Moscibroda, Stefan Schmid, and Rogert Wattenhofer. When Selfish Meets Evil: Byzantine Players in a Virus Inoculation Game. In PODC. ACM, 2006. Google Scholar
  42. Satoshi Nakamoto. Bitcoin: A peer-to-peer electronic cash system, 2008. Google Scholar
  43. Michael Reiter. The Rampart toolkit for building high-integrity services. Theory and Practice in Distributed Systems, 1995. Google Scholar
  44. Ronald L Rivest, Adi Shamir, and Leonard Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 1978. Google Scholar
  45. Soramitsu. Iroha - A simple, decentralized ledger. URL: http://iroha.tech/en/.
  46. Soramitsu. Sumeragi - a Byzantine Fault Tolerant consensus algorithm. https://github.com/hyperledger/iroha/blob/master/docs/iroha_whitepaper.md, 2017.
  47. Vikram Srinivasan, Pavan Nuggehalli, Carla-Fabiana Chiasserini, and Ramesh R Rao. Cooperation in wireless ad hoc networks. In INFOCOM. IEEE, 2003. Google Scholar
  48. Brian White, Jay Lepreau, Leigh Stoller, Robert Ricci, Shashi Guruprasad, Mac Newbold, Mike Hibler, Chad Barb, and Abhijeet Joglekar. An Integrated Experimental Environment for Distributed Systems and Networks. In OSDI, 2002. Google Scholar
  49. Jian Yin, Jean-Philippe Martin, Arun Venkataramani, Lorenzo Alvisi, and Mike Dahlin. Separating agreement from execution for byzantine fault tolerant services. OSR, 2003. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail