Zero-knowledge proofs for set membership: efficient, succinct, modular
From MaRDI portal
Publication:2145404
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
- Accumulators from bilinear pairings and applications
- 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
- Computationally private information retrieval with polylogarithmic communication
- Dynamic accumulators and application to efficient revocation of anonymous credentials
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Fine-Tuning Groth-Sahai Proofs
- Non-interactive zero-knowledge proofs for composite statements
- On the size of pairing-based non-interactive arguments
- One-way accumulators: A decentralized alternative to digital signatures
- Removing the strong RSA assumption from arguments over the integers
- Secure hash-and-sign signatures without the random oracle
- Statistical zero knowledge protocols to prove modular polynomial relations
- Streaming authenticated data structures
- The Knowledge Complexity of Interactive Proof Systems
- 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
(18)- 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
- General techniques for building SNARKs over the integers
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)