Despite offering numerous advantages, public decentralized cryptocurrencies such as Bitcoin suffer from scalability issues such as high transaction latency and low throughput. The vast array of so-called Layer-2 solutions tackling the scalability problem focus on throughput, and consider latency as a secondary objective. However, in the context of retail payments, instant finality of transactions is arguably a more pressing concern, besides the overarching concern for privacy. In this paper, we provide an overlay network that allows privacy-friendly low latency payments in a retail market. Our approach follows that of a recent work called Snappy, which achieved low latency but exposed identities of customers and their transaction histories. Our construction ensures this data is kept private, while providing merchants with protection against double-spending attacks. Although our system is still based upon customers registering with a collateral, crucially this collateral is reusable over time. The technical novelty of our work comes from randomness-reusable threshold encryption (RRTE), a cryptographic primitive we designed specifically for the following features: our construction provably guarantees payments to merchants, preserves the secret identity of honest customers and prevents their transactions from being linked. We also present an implementation of our construction, showing its capacity for fast global payments in a retail setting with a delay of less than 1 s.
Lecture Notes in Computer Science
Towards a Quantitative Theory of Integer Programming
28th Australasian Conference on Information Security and Privacy, ACISP 2023
Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands

Madhusudan, A, Sedaghat, M, Tiwari, S.S.K, Cong, K, & Preneel, B. (2023). Reusable, instant and private payment guarantees for cryptocurrencies. In Proceedings of the Australasian Conference on Information Security and Privacy (pp. 580–605). doi:10.1007/978-3-031-35486-1_25