Zero-knowledge proofs for set membership: efficient, succinct, modular
From MaRDI portal
Recommendations
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Zero-Knowledge Sets With Short Proofs
- Zero-Knowledge Sets with Short Proofs
- Zero-Knowledge Accumulators and Set Algebra
- Efficient zero-knowledge proofs. (Abstract)
- scientific article; zbMATH DE number 828007
- On zero-knowledge proofs (extended abstract)
- Efficient Protocols for Set Membership and Range Proofs
- Zero knowledge with efficient provers
Cites work
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- A survey on IQ cryptography
- 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
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Efficient NIZKs for algebraic sets
- 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?)
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- 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
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Signatures of correct computation
- Streaming authenticated data structures
- The distinction between fixed and random generators in group-based assumptions
- 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
- Vector commitments and their applications
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Zero-knowledge proofs for set membership: efficient, succinct, modular
Cited in
(5)- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Zero-Knowledge Accumulators and Set Algebra
- On zero-knowledge proofs (extended abstract)
- Set (non-)membership NIZKs from determinantal accumulators
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments
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 Q6063130)
