Cryptology ePrint Archive: Report 2022/083

Zef: Low-latency, Scalable, Private Payments

Mathieu Baudet and Alberto Sonnino and Mahimna Kelkar and George Danezis

Abstract: We introduce Zef, the first Byzantine-Fault Tolerant (BFT) protocol to support payments in anonymous digital coins at arbitrary scale. Zef follows the communication and security model of FastPay: both protocols are asynchronous, low-latency, linearly-scalable, and powered by partially-trusted sharded authorities. In contrast with FastPay, user accounts in Zef are uniquely-identified and safely removable. Zef coins are bound to an account by a digital certificate and otherwise stored off-chain by their owners. To create and redeem coins, users interact with the protocol via privacy-preserving operations: Zef uses randomized commitments and NIZK proofs to hide coin values; and, created coins are made unlinkable using the blind and randomizable threshold anonymous credentials of Coconut. Besides the detailed specifications and our analysis of the protocol, we are making available an open-source implementation of Zef in Rust. 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.

Category / Keywords: cryptographic protocols /

Date: received 21 Jan 2022, last revised 10 Mar 2022

Contact author: mathieu baudet at zefchain com, asonnino at fb com, mahimna at cs cornell edu, g danezis at ucl ac uk

Available format(s): PDF | BibTeX Citation

Version: 20220310:012713 (All versions of this report)

Short URL: ia.cr/2022/083


[ Cryptology ePrint archive ]