Table of Contents
Fetching ...

A DLT-based Smart Contract Architecture for Atomic and Scalable Trading

J. Kalbantner, K. Markantonakis, D. Hurley-Smith, C. Shepherd, B. Semal

TL;DR

A smart contract-based Credit-Note System (CNS) that allows participants to lock funds before a state channel initialisation, which enhances flexibility and efficiency and achieves the stated design goals of privacy, scalability, and atomicity.

Abstract

Distributed Ledger Technology (DLT) has an enormous potential but also downsides. One downside of many DLT systems, such as blockchain, is their limited transaction throughput that hinders their adoption in many use cases (e.g., real-time payments). State channels have emerged as a potential solution to enhance throughput by allowing transactions to process off-chain. While current proposals can increase scalability, they require high collateral and lack support for dynamic systems that require asynchronous state transitions. Additionally, the latency of channel initialisations can cause issues especially if fast interactions are required. In this paper, we propose an atomic, scalable and privacy-preserving protocol that enables secure and dynamic updates. We develop a smart contract-based Credit-Note System (CNS) that allows participants to lock funds before a state channel initialisation, which enhances flexibility and efficiency. We formalise our model using the Universal Composability (UC) framework and demonstrate that it achieves the stated design goals of privacy, scalability, and atomicity. Moreover, we implement a dispute process in the state channel to counter availability attacks. Finally, we analyse the protocol in the context of an asynchronous smart grid-based marketplace.

A DLT-based Smart Contract Architecture for Atomic and Scalable Trading

TL;DR

A smart contract-based Credit-Note System (CNS) that allows participants to lock funds before a state channel initialisation, which enhances flexibility and efficiency and achieves the stated design goals of privacy, scalability, and atomicity.

Abstract

Distributed Ledger Technology (DLT) has an enormous potential but also downsides. One downside of many DLT systems, such as blockchain, is their limited transaction throughput that hinders their adoption in many use cases (e.g., real-time payments). State channels have emerged as a potential solution to enhance throughput by allowing transactions to process off-chain. While current proposals can increase scalability, they require high collateral and lack support for dynamic systems that require asynchronous state transitions. Additionally, the latency of channel initialisations can cause issues especially if fast interactions are required. In this paper, we propose an atomic, scalable and privacy-preserving protocol that enables secure and dynamic updates. We develop a smart contract-based Credit-Note System (CNS) that allows participants to lock funds before a state channel initialisation, which enhances flexibility and efficiency. We formalise our model using the Universal Composability (UC) framework and demonstrate that it achieves the stated design goals of privacy, scalability, and atomicity. Moreover, we implement a dispute process in the state channel to counter availability attacks. Finally, we analyse the protocol in the context of an asynchronous smart grid-based marketplace.

Paper Structure

This paper contains 36 sections, 1 theorem, 9 equations, 19 figures.

Key Result

Theorem 6.1

Let the digital signature scheme from Section sec:digitalsignaturescheme be EU-CMA (Existential Unforgeability under a Chosen Message Attack) secure goldwasserDigitalSignatureScheme1988, then the protocol UC-realises the ideal functionality $\mathcal{F}$ in the model of ($\mathcal{F}_{SMT}, \mathcal

Figures (19)

  • Figure 1: Model overview.
  • Figure 2: Ledger Functionality $\mathcal{L}$.
  • Figure 3: Credit-note system (CNS) overview of a successful process.
  • Figure 4: Functionality of the Merchant's Smart Contract ($MSC$).
  • Figure 5: Functionality of the Entity Smart Contract ($ESC$).
  • ...and 14 more figures

Theorems & Definitions (2)

  • Definition 3.1
  • Theorem 6.1