Zero-Knowledge Sets with Short Proofs
From MaRDI portal
Recommendations
Cites work
- Advances in Cryptology - EUROCRYPT 2004
- An efficient existentially unforgeable signature scheme and its applications
- scientific article; zbMATH DE number 4057439 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 708808 (Why is no real title available?)
- scientific article; zbMATH DE number 1406771 (Why is no real title available?)
- Independent Zero-Knowledge Sets
- Mercurial Commitments with Applications to Zero-Knowledge Sets
- New generation of secure and practical RSA-based signatures
- Noninteractive Zero-Knowledge
- Security Analysis of the Strong Diffie-Hellman Problem
- Theory of Cryptography
- Updatable Zero-Knowledge Databases
Cited in
(25)- Zero-knowledge proofs for set membership: efficient, succinct, modular
- 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
- Efficient Protocols for Set Membership and Range Proofs
- Statistically Hiding Sets
- Vector commitments and their applications
- Mercurial Commitments with Applications to Zero-Knowledge Sets
- Theory of Cryptography
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Succinct vector, polynomial, and functional commitments from lattices
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- PointProofs, revisited
- Chainable functional commitments for unbounded-depth circuits
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
- Zero-knowledge functional elementary databases
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Fully homomorphic encryption with chosen-ciphertext security from LWE
- Identity-based trapdoor mercurial commitments and applications
- Foundations of data availability sampling
- Pairing-based functional commitments for circuits with shorter parameters
This page was built for publication: Zero-Knowledge Sets with Short Proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458606)