Search Results

Documents authored by Bissias, George


Document
Tailstorm: A Secure and Fair Blockchain for Cash Transactions

Authors: Patrik Keller, Ben Glickenhaus, George Bissias, and Gregory Griffith

Published in: LIPIcs, Volume 282, 5th Conference on Advances in Financial Technologies (AFT 2023)


Abstract
Proof-of-work (PoW) cryptocurrencies rely on a balance of security and fairness in order to maintain a sustainable ecosystem of miners and users. Users demand fast and consistent transaction confirmation, and in exchange drive the adoption and valuation of the cryptocurrency. Miners provide the confirmations, however, they primarily seek rewards. In unfair systems, miners can amplify their rewards by consolidating mining power. Centralization however, undermines the security guarantees of the system and might discourage users. In this paper we present Tailstorm, a cryptocurrency that strikes this balance. Tailstorm merges multiple recent protocol improvements addressing security, confirmation latency, and throughput with a novel incentive mechanism improving fairness. We implement a parallel proof-of-work consensus mechanism with k PoWs per block to obtain state-of-the-art consistency guarantees [Patrik Keller and Rainer Böhme, 2022]. Inspired by Bobtail [George Bissias and Brian Neil Levine, 2020] and Storm [awemany, 2019], we structure the individual PoWs in a tree which, by including a list of transactions with each PoW, reduces confirmation latency and improves throughput. Our proposed incentive mechanism discounts rewards based on the depth of this tree. Thereby, it effectively punishes information withholding, the core attack strategy used to reap an unfair share of rewards. We back our claims with a comprehensive analysis. We present a generic system model which allows us to specify Bitcoin, B_k [Patrik Keller and Rainer Böhme, 2022], and Tailstorm from a joint set of assumptions. We provide an analytical bound for the fairness of Tailstorm and Bitcoin in honest networks and we confirm the results through simulation. We evaluate the effectiveness of dishonest behaviour through reinforcement learning. Our attack search reproduces known optimal strategies against Bitcoin, uncovers new ones against B_k, and confirms that Tailstorm’s reward discounting makes it more resilient to incentive layer attacks. Our results are reproducible with the material provided online [Keller and Glickenhaus, 2023]. Lastly, we have implemented a prototype of the Tailstorm cryptocurrency as a fork of Bitcoin Cash. The client software is ready for testnet deployment and we also publish its source online [Griffith and Bissias, 2023].

Cite as

Patrik Keller, Ben Glickenhaus, George Bissias, and Gregory Griffith. Tailstorm: A Secure and Fair Blockchain for Cash Transactions. In 5th Conference on Advances in Financial Technologies (AFT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 282, pp. 6:1-6:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)


Copy BibTex To Clipboard

@InProceedings{keller_et_al:LIPIcs.AFT.2023.6,
  author =	{Keller, Patrik and Glickenhaus, Ben and Bissias, George and Griffith, Gregory},
  title =	{{Tailstorm: A Secure and Fair Blockchain for Cash Transactions}},
  booktitle =	{5th Conference on Advances in Financial Technologies (AFT 2023)},
  pages =	{6:1--6:26},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-303-4},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{282},
  editor =	{Bonneau, Joseph and Weinberg, S. Matthew},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AFT.2023.6},
  URN =		{urn:nbn:de:0030-drops-191954},
  doi =		{10.4230/LIPIcs.AFT.2023.6},
  annote =	{Keywords: Proof-of-Work, Blockchain, Cryptocurrency, Mining Rewards, Fairness}
}
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