Mercurial Commitments with Applications to Zero-Knowledge Sets
From MaRDI portal
Recommendations
Cited in
(21)- Hybrid commitments and their applications to zero-knowledge proof systems
- Anonymous protocols: notions and equivalence
- Mercurial commitments with applications to zero-knowledge sets
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
- Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
- Zero-Knowledge Accumulators and Set Algebra
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Independent Zero-Knowledge Sets
- Statistically Hiding Sets
- Vector commitments and their applications
- Zero-Knowledge Sets with Short Proofs
- Theory of Cryptography
- Black-box anonymous commit-and-prove
- Rotatable zero knowledge sets. Post compromise secure auditable dictionaries with application to key transparency
- Succinct arguments for RAM programs via projection codes
- Zero-knowledge functional elementary databases
- Updatable, aggregatable, succinct mercurial vector commitment from lattice
- Zero-knowledge RAM: doubly efficient and black-box
- Lattice-based succinct mercurial functional commitment for Boolean circuits: definitions, and constructions
- Identity-based trapdoor mercurial commitments and applications
- Foundations of data availability sampling
This page was built for publication: Mercurial Commitments with Applications to Zero-Knowledge Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385743)