Welcome to the resource topic for 2024/1647
Title:
Curve Forests: Transparent Zero-Knowledge Set Membership with Batching and Strong Security
Authors: Matteo Campanelli, Mathias Hall-Andersen, Simon Holmgaard Kamp
Abstract:Zero-knowledge for set membership is a building block at the core of several privacy-aware applications, such as anonymous payments, credentials and whitelists.
We propose a new efficient construction for the batching variant of the problem, where a user intends to show knowledge of several elements (a batch) in a set without any leakage on the elements. Our construction is transparent—it does not requires a trusted setup—and based on Curve Trees by Campanelli, Hall-Andersen and Kamp (USENIX 2023). Our first technical contribution consists in techniques to amortize Curve Trees costs in the batching setting for which we crucially exploit its algebraic properties. Even for small batches we obtain \approx 2\times speedups for proving, \approx3\times speedups for verification and \approx 60\% reduction in proof size. Our second contribution is a modifications of a key technical requirement in Curve Trees (related to so called “permissible points”) which arguably simplifies its design and obtains a stronger security property. In particular, our construction is secure even for the case where the commitment to the set is provided by the adversary (in contrast to the honest one required by the original Curve Trees).
ePrint: https://eprint.iacr.org/2024/1647
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .