Instant Zero Knowledge Proof of Reserve

Trevor Conley; Nilsso Diaz; Diego Espada; Alvin Kuruvilla; Stenton Mayone; Xiang Fu

Paper 2023/1156 Original: eprint.iacr.org/2023/1156 ↗

Instant Zero Knowledge Proof of Reserve

Trevor Conley

Nilsso Diaz

Diego Espada

Alvin Kuruvilla

Stenton Mayone

Xiang Fu

Abstract

We present a non-interactive and public verifier scheme that allows one to assert the asset of a financial organization instantly and incrementally in zero knowledge with high throughput. It is enabled by the recent breakthrough in lookup argument, where the prover cost can be independent of the lookup table size after a pre-processing step. We extend the cq protocol and develop an aggregated non-membership proof for zero knowledge sets. Based on it, we design a non-intrusive protocol that works for pseudo-anonymous cryptocurrencies such as BTC. It has O(n log(n)) prover complexity and O(1) proof size, where n is the platform throughput (instead of anonymity set size). We implement and evaluate the protocol. Running on a 56-core server, it supports 1024 transactions per second.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
History: 2024-05-03: last updated; 2023-07-26: published
Short URL: https://ia.cr/2023/1156
License: https://creativecommons.org/licenses/by-nc/4.0/

BibTeX

@misc{cryptoeprint:2023/1156,
      author = {Trevor Conley and Nilsso Diaz and Diego Espada and Alvin Kuruvilla and Stenton Mayone and Xiang Fu},
      title = {Instant Zero Knowledge Proof of Reserve},
      howpublished = {Cryptology {ePrint} Archive, Paper 2023/1156},
      year = {2023},
      url = {https://eprint.iacr.org/2023/1156}
}