Baudet, Mathieu;
Sonnino, Alberto;
Kelkar, Mahimna;
Danezis, George;
(2023)
Zef: Low-latency, Scalable, Private Payments.
In:
WPES '23: Proceedings of the 22nd Workshop on Privacy in the Electronic Society.
(pp. pp. 1-16).
ACM (Association for Computing Machinery): New York, NY, USA.
Preview |
Text
Sonnino_zef_Accepted version.pdf Download (733kB) | Preview |
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.
| Type: | Proceedings paper |
|---|---|
| Title: | Zef: Low-latency, Scalable, Private Payments |
| Event: | CCS '23: ACM SIGSAC Conference on Computer and Communications Security |
| Location: | DENMARK, Copenhagen |
| Dates: | 26 Nov 2023 |
| ISBN-13: | 9798400702358 |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1145/3603216.3624952 |
| Publisher version: | http://dx.doi.org/10.1145/3603216.3624952 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| Keywords: | Anonymous credentials; byzantine fault tolerance; confidential payments; distributed systems; privacy-enhancing technology; private payments; unlinkabile payments |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery-pp.ucl.ac.uk/id/eprint/10198601 |
Archive Staff Only
 |
View Item |
