Curve trees: Practical and transparent {Zero-Knowledge} accumulators

M Campanelli, M Hall-Andersen, SH Kamp - 32nd USENIX Security …, 2023 - usenix.org
In this work we improve upon the state of the art for practical zero-knowledge for set
membership, a building block at the core of several privacy-aware applications, such as …

Curve Trees: Practical and Transparent Zero-Knowledge Accumulators

M Campanelli, M Hall-Andersen, SH Kamp - usenix.org
We provide a Rust implementation of Curve Trees instantiated with Bulletproofs. The
repository includes an implementation of the select and rerandomize primitive, which proofs …

[引用][C] Curve Trees: Practical and Transparent Zero-Knowledge Accumulators

M Campanelli, MN Hall-Andersen… - SEC'23: Proceedings of the …, 2023 - pure.au.dk
Curve Trees: Practical and Transparent Zero-Knowledge Accumulators — Aarhus University
Skip to main navigation Skip to search Skip to main content Aarhus University Home Aarhus …

[PDF][PDF] Curve Trees: Practical and Transparent Zero-Knowledge Accumulators

M Campanelli, M Hall-Andersen - 2022 - research.protocol.ai
In this work we propose a new accumulator construction and efficient ways to prove
knowledge of some element in a set without leaking anything about the element. This …

Curve Trees: Practical and Transparent Zero-Knowledge Accumulators

M Campanelli, M Hall-Andersen… - Cryptology ePrint Archive, 2022 - eprint.iacr.org
In this work we improve upon the state of the art for practical zero-knowledge for set
membership, a building block at the core of several privacy-aware applications, such as …

Curve trees: practical and transparent zero-knowledge accumulators

M Campanelli, M Hall-Andersen, SH Kamp - Proceedings of the 32nd …, 2023 - dl.acm.org
In this work we improve upon the state of the art for practical zero-knowledge for set
membership, a building block at the core of several privacy-aware applications, such as …

[PDF][PDF] Curve Trees: Practical and Transparent Zero-Knowledge Accumulators

M Campanelli, M Hall-Andersen - 2022 - grants.protocol.ai
In this work we propose a new accumulator construction and efficient ways to prove
knowledge of some element in a set without leaking anything about the element. This …