Fast and secure global payments with Stellar

  title={Fast and secure global payments with Stellar},
  author={Marta Lokhava and Giuliano Losa and David Mazi{\`e}res and Graydon Hoare and Nicolas Barry and Eli Gafni and Jonathan Jove and Rafał Malinowsky and Jed McCaleb},
  journal={Proceedings of the 27th ACM Symposium on Operating Systems Principles},
International payments are slow and expensive, in part because of multi-hop payment routing through heterogeneous banking systems. Stellar is a new global payment network that can directly transfer digital money anywhere in the world in seconds. The key innovation is a secure transaction mechanism across untrusted intermediaries, using a new Byzantine agreement protocol called SCP. With SCP, each institution specifies other institutions with which to remain in agreement; through the global… 
SPEEDEX: A Scalable, Parallelizable, and Economically Efficient Digital EXchange
SPEEDEX’s key design insight is to use an Arrow-Debreu exchange market structure that fixes the valuation of assets for all trades in a given block of transactions, which makes trade operations commutative and hence efficiently parallelizable.
SPEEDEX: A Scalable, Parallelizable, and Economically Efficient Distributed EXchange
SPEEDEX is a decentralized exchange (DEX) that lets par-ticipants securely trade assets without giving any single party undue control over the market. SPEEDEX offers several ad-vantages over prior
Design Choices for Central Bank Digital Currency: Policy and Technical Considerations
This paper enumerates the fundamental technical design challenges facing CBDC designers, with a particular focus on performance, privacy, and security, and presents a vision of the rich range of functionalities and use cases that a well-designed CBDC platform could ultimately offer users.
CollaChain: A BFT Collaborative Middleware for Decentralized Applications
This paper proposes CollaChain, a new byzantine fault tolerant blockchain compatible with the largest ecosystem of DApps that leverages collaboration and offers the possibility to its users to interact securely with each other without downloading the blockchain, hence allowing interactions via mobile devices.
The Sum of Its Parts: Analysis of Federated Byzantine Agreement Systems
This paper proposes an intuitive yet precise methodology for determining whether the quorum systems resulting from such individual configurations can enable liveness and safety, respectively how many (byzantine) node failures they are away from losing these qualities.
Building Own Blockchain
The implementation and experiences with the public, permissionless part of Own dual blockchain are described and Own public blockchain consensus is described, which is based on the Tendermint BFT consensus algorithm and modified towards simplicity and robustness, and open-source implemented from scratch in F#.
How to Trust Strangers: Composition of Byzantine Quorum Systems
This work answers the question for the first time and offers composition rules for symmetric and for asymmetric quorum systems and shows how consensus is actually possible, even with the combination of disjoint sets of processes.
Red Belly: A Secure, Fair and Scalable Open Blockchain
Although its performance is affected by attacks, RBBC scales in that its throughput increases to hundreds of consensus nodes and achieves 30k TPS throughput and 3 second latency on 1000 VMs, hence improving by 3× both the latency and the throughput of its closest competitor.
Decentralization in Open Quorum Systems
Drawing from game theory and computational complexity, limiting results concerning the decentralisation vs. safety trade-off in Ripple and Stellar are established, and a novel methodology is proposed to formalise and quantitatively analyse decentralisation in this type of blockchains.
Fault-Tolerant Distributed Transactions on Blockchain
An in-depth study of blockchain, unraveling its revolutionary promise to instill computational trust in society, is presented, all carefully tailored to a broad audience including students, researchers, and practitioners.


The Stellar Consensus Protocol : A Federated Model for Internet-level Consensus
A new model for consensus called federated Byzantine agreement (FBA), which achieves robustness through quorum slices—individual trust decisions made by each node that together determine system-level quorums.
Bitcoin: A Peer-to-Peer Electronic Cash System
This work proposes a solution to the double-spending problem using a peer-to-peer network, where the network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof- of-work.
PPCoin: Peer-to-Peer Crypto-Currency with Proof-of-Stake
Under this hybrid design proof-of-work mainly provides initial minting and is largely non-essential in the long run thus providing an energyefficient and more cost-competitive peer-to-peer crypto-currency.
Is Stellar As Secure As You Think?
This study analyzes FBA, whose security is highly dependent on the structure of quorum slices, and demonstrates that it is not superior to the traditional BFT algorithm in terms of safety and liveness.
NeuCoin: The First Secure, Cost-Efficient and Decentralized Cryptocurrency
This paper demonstrates how NeuCoin’s proof-of-stake implementation addresses all commonly raised “nothing at stake” objections to generic proof- of-Stake systems, and reviews many of the flaws of proof-Of-work designs to highlight the potential for an alternate cryptocurrency that solves these flaws.
Cobalt: BFT Governance in Open Networks
We present Cobalt, a novel atomic broadcast algorithm that works in networks with non-uniform trust and no global agreement on participants, and is probabilistically guaranteed to make forward
Distributed Protocols and Heterogeneous Trust: Technical Report
This work explores how to construct distributed protocols that meet the requirements of all participants, even in heterogeneous trust environments, using lattice-based information flow to analyse and prove protocol properties.
KYC Optimization Using Distributed Ledger Technology
A new system, based on distributed ledger technology (DLT), that reduces the costs of the core KYC verification process for financial institutions and improves the customer experience and increased transparency throughout the process of onboarding a customer is proposed.
Federated Byzantine Quorum Systems
It is shown that this setting leads to a novel variant of Byzantine quorum systems where different nodes may have different understanding of what constitutes a quorum, and correctness in the realistic setting where Byzantine nodes may lie about their trust choices is proved.
The Stellar Consensus Protocol (SCP)
SCP is an open Byzantine agreement protocol resistant to Sybil attacks. It allows Internet infrastructure stakeholders to reach agreement on a series of values without unanimous agreement on what