Jun 13, 2022 · We propose novel, more efficient and fully transparent constructions (ie, without a trusted setup) for accumulators supporting zero-knowledge proofs for set ...

We propose novel, more efficient and fully transparent constructions (i.e., without a trusted setup) for accumulators supporting zero-knowledge proofs for set ...

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 ...

Jun 29, 2023 · Title, Curve Trees: Practical and Transparent Zero-Knowledge Accumulators. Publication Type, Conference Paper. Year of Publication, 2023.

Jun 13, 2022 · Curve trees can be instantiated to be efficient in practice: the commitment to a set (accumulator) is 256 bits for any set size; for a set of ...

Curve Trees: Practical and Transparent Zero-Knowledge Accumulators ; Joe Calandrino, Carmela Troncoso · New York · Association for Computing Machinery · Oct 2023.

May 30, 2024 · USENIX Security '23 – Curve Trees: Practical and Transparent Zero-Knowledge Accumulators. by Marc Handelman on May 30, 2024. Authors ...

May 30, 2024 · USENIX Security '23 - Curve Trees: Practical and Transparent Zero-Knowledge Accumulators → · May 30, 2024 by Marc Handelman in USENIX, USENIX ...

We are not allowed to display external PDFs yet. You will be redirected to the full text document in the repository in a few seconds, if not click here.

Jun 15, 2022 · 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 ...