We investigate the problem of designing commit-and-prove zero-knowledge systems for set mem- bership and non-membership that can be used in a modular way and ...
Jul 1, 2023 · We design new modular and efficient constructions for this problem through new commit-and-prove zero-knowledge systems for set membership.
Oct 23, 2021 · We design new modular and efficient constructions for this problem through new commit-and-prove zero-knowledge systems for set membership.
Duration: 1:00:15
Posted: Mar 18, 2021
Posted: Mar 18, 2021
Zero-Knowledge Proofs for Set Membership - ZKProof Standards
zkproof.org › 2020/02/27 › zkp-set-me...
Feb 27, 2020 · In this post, I will attempt to present the problem of proving set membership in zero-knowledge — proving that an element is part of a large public set without ...
People also ask
How do you write a zero-knowledge proof?
What are the three properties which a protocol must satisfy to be a zero-knowledge proof?
What are general zero-knowledge proofs?
What are the prerequisites for zero-knowledge proof?
Jul 1, 2023 · We design new modular and efficient constructions for this problem through new commit-and-prove zero-knowledge systems for set membership, i.e. ...
The problem of proving in zero knowledge that an element of a public set satisfies a given property without disclosing the element is considered, i.e., ...
Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular. Daniel Benarroch, Matteo Campanelli, Dario Fiore, Kobi Gurkan, Dimitris Kolonelos.
Implements various RSA-based protocols from the Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular paper.
In this talk we will discuss alternative approaches for Set Membership Zero-Knowledge Proofs that are modular, succinct and efficient.