Zero-knowledge proofs for set membership: efficient, succinct, modular
From MaRDI portal
Publication:2145404
DOI10.1007/978-3-662-64322-8_19zbMath1491.94038OpenAlexW3208203740MaRDI QIDQ2145404
Kobi Gurkan, Dimitris Kolonelos, Dario Fiore, Matteo Campanelli, Daniel Benarroch
Publication date: 17 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-662-64322-8_19
Related Items
CPSNARKs-Set, 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, Zero-knowledge proofs for set membership: efficient, succinct, modular
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-interactive zero-knowledge proofs for composite statements
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Universally composable two-party and multi-party secure computation
- Universal Accumulators with Efficient Nonmembership Proofs
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- The Knowledge Complexity of Interactive Proof Systems
- Secure Hash-and-Sign Signatures Without the Random Oracle
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Streaming Authenticated Data Structures
- Close to Uniform Prime Number Generation with Fewer Random Bits
- Fine-Tuning Groth-Sahai Proofs
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Topics in Cryptology – CT-RSA 2005
- Removing the Strong RSA Assumption from Arguments over the Integers
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- On the Size of Pairing-Based Non-interactive Arguments
