exchange

Base system with REST service to issue digital coins, run by the payment service provider
Log | Files | Refs | Submodules | README | LICENSE

abstract.tex (3146B)


      1 \chapter{Abstract}
      2 %As our society becomes more and more digitalized, an electronic version of cash
      3 %becomes inevitable.  The design of payment systems is not just a technological
      4 %matter, but has far-reaching sociopolitical consequences.
      5 \begin{samepage}
      6 We describe the design and implementation of GNU Taler, an electronic payment
      7 system based on an extension of Chaumian online e-cash with efficient change.
      8 In addition to anonymity for customers, it provides the novel notion of
      9 \emph{income transparency}, which guarantees that merchants can reliably
     10 receive a payment from an untrusted payer only when their income from the
     11 payment is visible to tax authorities.
     12 
     13 Income transparency is achieved by the introduction of a \emph{refresh
     14 protocol}, which gives anonymous change for a partially spent coin without
     15 introducing a tax evasion loophole.  In addition to income transparency, the
     16 refresh protocol can be used to implement Camenisch-style \emph{atomic swaps}, and to
     17 preserve anonymity in the presence of protocol \emph{aborts} and crash faults with
     18 data loss by participants.
     19 
     20 Furthermore, we show the provable security of our income-transparent anonymous
     21 e-cash, which, in addition to the usual \emph{anonymity} and
     22 \emph{unforgeability} properties of e-cash, also formally models
     23 \emph{conservation} of funds and income transparency.
     24 
     25 Our implementation of GNU Taler is usable by non-expert users and integrates
     26 with the modern Web architecture.  Our payment platform addresses a range of
     27 practical issues, such as tipping customers, providing refunds, integrating
     28 with banks and know-your-customer (KYC) checks, as well as Web platform
     29 security and reliability requirements.  On a single machine, we achieve
     30 transaction rates that rival those of global, commercial credit card
     31 processors.  We increase the robustness of the exchange---the component that
     32 keeps bank money in escrow in exchange for e-cash---by adding an auditor
     33 component, which verifies the correct operation of the system and allows to
     34 detect a compromise or misbehavior of the exchange early.
     35 
     36 Just like bank accounts have reason to exist besides bank notes, e-cash only
     37 serves as part of a whole payment system stack.  Distributed ledgers have
     38 recently gained immense popularity as potential replacement for parts of the
     39 traditional financial industry.  While cryptocurrencies based on proof-of-work
     40 such as Bitcoin have yet to scale to be useful as a replacement for established
     41 payment systems, other more efficient systems based on blockchains with more
     42 classical consensus algorithms might still have promising applications in the
     43 financial industry.
     44 
     45 We design, implement and analyze the performance of \emph{Byzantine Set Union
     46 Consensus} (BSC), a Byzantine consensus protocol that agrees on a (super-)set
     47 of elements at once, instead of sequentially agreeing on the individual
     48 elements of a set.  While BSC is interesting in itself, it can also be used as
     49 a building block for permissioned blockchains, where---just like in
     50 Nakamoto-style consensus---whole blocks of transactions are agreed upon at once,
     51 increasing the transaction rate.
     52 \end{samepage}