Fractional Payment Transactions: Executing Payment Transactions in Parallel with Less than f+1 Validations (2405.05645v1)
Abstract: We consider the problem of supporting payment transactions in an asynchronous system in which up to $f$ validators are subject to Byzantine failures under the control of an adaptive adversary. It was shown that, in the case of a single owner, this problem can be solved without consensus by using byzantine quorum systems (requiring a quorum of $2f+1$ validations per transaction). Nonetheless, the process of validating transactions remains sequential. For example, if one has a balance of ten coins and intends to make separate payments of two coins each to two distinct recipients, both transactions must undergo processing by a common correct validator. On the other hand, these two transactions are non-conflicting as they do not lead to double spending, allowing in principle for parallel validation. In this paper, we show that it is possible to validate payment transactions in parallel with less than $f$ validations per transaction in an asynchronous system, provided that each transaction spends only a small fraction of a balance. Our solution relies on a novel class of probabilistic quorum systems that we introduce in this paper, termed \textit{$(k_1,k_2)$-quorum systems}. In the absence of an adaptive adversary, \textit{$(k_1,k_2)$-quorum systems} can be used to enable concurrent and asynchronous validation of up to $k_1$ transactions while preventing validation of more than $k_2$ transactions. Employing a $(k_1, k_2)$-quorum system, we introduce protocols enabling a payer to validate multiple \textit{fractional spending} transactions in parallel with less than $f+1$ validations per transaction. Subsequently, the payer reclaims any remaining funds through a fully validated transaction, referred to as a \textit{settlement} transaction.
- On the availability of non-strict quorum systems. In International Symposium on Distributed Computing, pages 48–62. Springer, 2005.
- Byzantine and multi-writer k-quorums. In International Symposium on Distributed Computing, pages 443–458. Springer, 2006.
- Dynamic probabilistic reliable broadcast. 2023. arXiv:2306.04221.
- Brick: Asynchronous incentive-compatible payment channels. In International Conference on Financial Cryptography and Data Security, pages 209–230. Springer, 2021.
- Amos Beimel. Secret-sharing schemes: A survey. In International conference on coding and cryptology, pages 11–46. Springer, 2011.
- Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communications Security, pages 62–73, 1993.
- Asynchronous verifiable secret sharing and proactive cryptosystems. In Proceedings of the 9th ACM Conference on Computer and Communications Security, pages 88–97, 2002.
- A fast and scalable payment network with bitcoin duplex micropayment channels. In Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems - Volume 9212, page 3–18, 2015.
- Taher ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE transactions on information theory, 31(4):469–472, 1985.
- Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374–382, 1985.
- Scalable byzantine reliable broadcast. In 33rd International Symposium on Distributed Computing, DISC 2019, volume 146 of LIPIcs, pages 22:1–22:16, 2019.
- Scalable byzantine reliable broadcast (extended version). CoRR, abs/1908.01738, 2019. URL: http://arxiv.org/abs/1908.01738, arXiv:1908.01738.
- The consensus number of a cryptocurrency. PODC ’19, page 307–316, 2019.
- Saurabh Gupta. A non-consensus based decentralized financial transaction processing model with support for efficient auditing. Master’s thesis, Arizona State University, June 2016.
- Probabilistic quorum systems. In Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, pages 267–273, 1997.
- Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, USA, 2005.
- Satoshi Nakamoto. Bitcoin: A peer-to-peer electronic cash system. URL: https://bitcoin.org/bitcoin.pdf, 2008.
- On payment channels in asynchronous money transfer systems. In Christian Scheideler, editor, 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, volume 246 of LIPIcs, pages 29:1–29:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. doi:10.4230/LIPIcs.DISC.2022.29.
- Scalable lightning factories for bitcoin. In Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, SAC ’19, page 302–309, New York, NY, USA, 2019. Association for Computing Machinery. doi:10.1145/3297280.3297312.
- The bitcoin lightning network: Scalable off-chain instant payments, 2016.
- A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 26(1):96–99, 1983.
- Abc: Proof-of-stake without consensus, 2019. URL: https://arxiv.org/abs/1909.10926, doi:10.48550/ARXIV.1909.10926.
- Gavin Wood. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper, 151(2014):1–32, 2014.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.