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

DOI10.1007/978-3-662-64322-8_19MaRDI QIDQ2145404zbMATH OpenOpenAlexFDO

Authors Daniel Benarroch, Matteo Campanelli, Dario Fiore, Kobi Gurkan, Dimitris Kolonelos

Publication date 17 June 2022

Full work available at URL https://doi.org/10.1007/978-3-662-64322-8_19

zbMATH Keywords

commit-and-prove zero-knowledge systems for set membershipsoftware library

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient Protocols for Set Membership and Range Proofs
• Zero-Knowledge Sets with Short Proofs
• Zero-Knowledge Accumulators and Set Algebra
• SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
• Non-Interactive Zero-Knowledge Proofs of Non-Membership

Cites work

• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
• Batching techniques for accumulators with applications to IOPs and stateless blockchains
• Close to uniform prime number generation with fewer random bits
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Fine-Tuning Groth-Sahai Proofs
• scientific article; zbMATH DE number 1304086 (Why is no real title available?)
• scientific article; zbMATH DE number 1088224 (Why is no real title available?)
• scientific article; zbMATH DE number 1942413 (Why is no real title available?)
• scientific article; zbMATH DE number 1394309 (Why is no real title available?)
• Non-interactive zero-knowledge proofs for composite statements
• On the size of pairing-based non-interactive arguments
• Removing the strong RSA assumption from arguments over the integers
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Streaming authenticated data structures
• The Knowledge Complexity of Interactive Proof Systems
• Topics in Cryptology – CT-RSA 2005
• Universal Accumulators with Efficient Nonmembership Proofs
• Universally composable two-party and multi-party secure computation
• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors

Cited in

(17)

• CPSNARKs-Set
• SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
• Zero-Knowledge Accumulators and Set Algebra
• A general, flexible and efficient proof of inclusion and exclusion
• On zero-knowledge proofs (extended abstract)
• Efficient Protocols for Set Membership and Range Proofs
• Zero-knowledge proofs for set membership: efficient, succinct, modular
• Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
• Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
• \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
• Set (non-)membership NIZKs from determinantal accumulators
• Oblivious accumulators
• Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments
• SNARKs for virtual machines are non-malleable
• Natively compatible super-efficient lookup arguments and how to apply them
• Beyond the circuit -- how to minimize foreign arithmetic in ZKP circuits
• Ba\textit{loo}: algebraic lookup arguments

Describes a project that uses

Uses Software

• Pinocchio
• LegoSNARK
• dalek
• EDRAX
• vSQL
• GitHub

This page was built for publication: Zero-knowledge proofs for set membership: efficient, succinct, modular

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2145404)