Zero-knowledge proofs for set membership: efficient, succinct, modular
From MaRDI portal
Publication:6063130
DOI10.1007/s10623-023-01245-1zbMath1526.94024OpenAlexW2991209463MaRDI QIDQ6063130
Matteo Campanelli, Dimitris Kolonelos, Daniel Benarroch, Dario Fiore, Kobi Gurkan
Publication date: 7 November 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-023-01245-1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-interactive zero-knowledge proofs for composite statements
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- The distinction between fixed and random generators in group-based assumptions
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
- 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
- Signatures of Correct Computation
- Vector Commitments and Their Applications
- Streaming Authenticated Data Structures
- Close to Uniform Prime Number Generation with Fewer Random Bits
- Fine-Tuning Groth-Sahai Proofs
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- 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
- Efficient NIZKs for algebraic sets
This page was built for publication: Zero-knowledge proofs for set membership: efficient, succinct, modular
