Zero-Knowledge Accumulators and Set Algebra
From MaRDI portal
Recommendations
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Zero-Knowledge Sets with Short Proofs
- Zero-Knowledge Sets With Short Proofs
- Independent Zero-Knowledge Sets
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials
Cites work
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Authenticated hash tables based on cryptographic accumulators
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- Efficient Asynchronous Accumulators for Distributed PKI
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Efficient set operations in the presence of malicious adversaries
- Fast accumulated hashing
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- scientific article; zbMATH DE number 1064637 (Why is no real title available?)
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 1962158 (Why is no real title available?)
- scientific article; zbMATH DE number 2009955 (Why is no real title available?)
- scientific article; zbMATH DE number 1759783 (Why is no real title available?)
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- scientific article; zbMATH DE number 1394309 (Why is no real title available?)
- scientific article; zbMATH DE number 1424194 (Why is no real title available?)
- Mercurial Commitments with Applications to Zero-Knowledge Sets
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- On the impossibility of batch update for cryptographic accumulators
- Optimal verification of operations on dynamic sets
- Primary-secondary-resolver membership proof systems
- Privacy-Preserving Set Operations
- Redactable signatures for independent removal of structure and content
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- Statistically Hiding Sets
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- The knowledge complexity of interactive proof-systems
- Topics in Cryptology – CT-RSA 2005
- Universal Accumulators with Efficient Nonmembership Proofs
- Updatable Zero-Knowledge Databases
- Vector commitments and their applications
- Verifiable set operations over outsourced databases
- Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
- Zero-Knowledge Accumulators and Set Algebra
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
- Zero-Knowledge Sets with Short Proofs
Cited in
(17)- Zero-knowledge proofs for set membership: efficient, succinct, modular
- New code-based privacy-preserving cryptographic constructions
- Zero-knowledge elementary databases with more expressive queries
- Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
- Zero-Knowledge Accumulators and Set Algebra
- Universal Accumulators with Efficient Nonmembership Proofs
- UC Updatable Databases and Applications
- Improved constructions of anonymous credentials from structure-preserving signatures on equivalence classes
- Optimal verification of operations on dynamic sets
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Logarithmic-size (linkable) threshold ring signatures in the plain model
- Rotatable zero knowledge sets. Post compromise secure auditable dictionaries with application to key transparency
- Zero-knowledge functional elementary databases
- Set (non-)membership NIZKs from determinantal accumulators
- Cryptographic accumulators: new definitions, enhanced security, and delegatable proofs
- Structure-preserving compressing primitives: vector commitments and accumulators and applications
- Universally composable accumulators
This page was built for publication: Zero-Knowledge Accumulators and Set Algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953773)
