Set (Non-)Membership NIZKs from Determinantal Accumulators

Lipmaa, Helger; Parisella, Roberto

doi:10.1007/978-3-031-44469-2_18

Lecture Notes in Computer Science

2023

DOI: 10.1007/978-3-031-44469-2_18

|View full text |Cite

Set (Non-)Membership NIZKs from Determinantal Accumulators

Helger Lipmaa,

Roberto Parisella

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Zero-knowledge proofs for set membership: efficient, succinct, modular

Benarroch¹,

Campanelli²,

Fiore³

et al. 2023

Des. Codes Cryptogr.

View full text Add to dashboard Cite

We consider the problem of proving in zero knowledge that an element of a public set satisfies a given property without disclosing the element, i.e., for some u, “$$u \in S$$ u ∈ S and P(u) holds”. This problem arises in many applications (anonymous cryptocurrencies, credentials or whitelists) where, for privacy or anonymity reasons, it is crucial to hide certain data while ensuring properties of such data. We design new modular and efficient constructions for this problem through new commit-and-prove zero-knowledge systems for set membership, i.e. schemes proving $$u \in S$$ u ∈ S for a value u that is in a public commitment $$c_u$$ c u . We also extend our results to support non-membership proofs, i.e. proving $$u \notin S$$ u ∉ S . Being commit-and-prove, our solutions can act as plug-and-play modules in statements of the form “$$u \in S$$ u ∈ S and P(u) holds” by combining our set (non-)membership systems with any other commit-and-prove scheme for P(u). Also, they work with Pedersen commitments over prime order groups which makes them compatible with popular systems such as Bulletproofs or Groth16. We implemented our schemes as a software library, and tested experimentally their performance. Compared to previous work that achieves similar properties—the clever techniques combining zkSNARKs and Merkle Trees in Zcash—our solutions offer more flexibility, shorter public parameters and $$3.7 \times $$ 3.7 × –$$30\times $$ 30 × faster proving time for a set of size $$2^{64}$$ 2 64 .

show abstract

Zero-knowledge proofs for set membership: efficient, succinct, modular

Benarroch¹,

Campanelli²,

Fiore³

et al. 2023

Des. Codes Cryptogr.

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Set (Non-)Membership NIZKs from Determinantal Accumulators

Cited by 1 publication

References 19 publications

Zero-knowledge proofs for set membership: efficient, succinct, modular

Zero-knowledge proofs for set membership: efficient, succinct, modular

Contact Info

Product

Resources

About