Zef: Low-latency, Scalable, Private Payments
Open Access
- 26 November 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-16
Abstract
Zef is the first Byzantine-Fault Tolerant (BFT) protocol to support payments in anonymous digital coins at arbitrary scale. Zef achieves its performance by forgoing the expense of BFT consensus and using instead Byzantine Consistent Broadcast as its core primitive. Zef is asynchronous, low-latency, linearly-scalable, and powered by partially-trusted sharded authorities. Zef introduces opaque coins represented as off-chain certificates that are bound to user accounts. In order to hide the values of coins when a payment operation consumes or creates them, Zef uses cryptographically hiding commitments and NIZK proofs. Coins creation and spending are unlinkable through the Coconut blind and randomizable threshold anonymous credentials scheme. To control storage costs associated with coin replay prevention, Zef allows safe accounts deletion once the account is deactivated. Our extensive benchmarks on AWS confirm textbook linear scalability and demonstrate a confirmation time under one second at nominal capacity. Compared to existing anonymous payment systems based on a blockchain, this represents a latency speedup of three orders of magnitude, with no theoretical limit on throughput.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- HotStuff2019
- Bulletproofs: Short Proofs for Confidential Transactions and More2018
- An Empirical Analysis of Traceability in the Monero BlockchainProceedings on Privacy Enhancing Technologies, 2018
- Short Randomizable Signatures2016
- Efficient Identity-Based Encryption Without Random Oracles2005
- Compact E-Cash2005
- Random oracles in constantipole2000
- Auditable, Anonymous Electronic Cash1999
- Consensus in the presence of partial synchronyJournal of the ACM, 1988
- Blind Signatures for Untraceable Payments1983