Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
From MaRDI portal
Recommendations
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Automata, Languages and Programming
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Efficient Identity-Based Encryption Without Random Oracles
- Financial Cryptography
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- scientific article; zbMATH DE number 4057443 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- Independent Zero-Knowledge Sets
- Mercurial Commitments with Applications to Zero-Knowledge Sets
- New approaches for deniable authentication
- Pairing-Friendly Elliptic Curves of Prime Order
- Programmable Hash Functions and Their Applications
- Security Analysis of the Strong Diffie-Hellman Problem
- Statistically Hiding Sets
- Theory of Cryptography
- Universally Composable Security with Global Setup
- Updatable Zero-Knowledge Databases
- Zero-Knowledge Sets with Short Proofs
Cited in
(59)- Somewhere statistically binding commitment schemes with applications
- High-threshold AVSS with optimal communication complexity
- UC priced oblivious transfer with purchase statistics and dynamic pricing
- Mercurial commitments with applications to zero-knowledge sets
- Succinct functional commitment for a large class of arithmetic circuits
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- Non-malleable vector commitments via local equivocability
- Vector and functional commitments from lattices
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
- Non-zero inner product encryption with short ciphertexts and private keys
- Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
- Zero-Knowledge Accumulators and Set Algebra
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- Independent Zero-Knowledge Sets
- Vector commitments and their applications
- UC Updatable Databases and Applications
- Mercurial Commitments with Applications to Zero-Knowledge Sets
- Zero-Knowledge Sets with Short Proofs
- Theory of Cryptography
- Non-malleable vector commitments via local equivocability
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Functional commitments for all functions, with transparent setup and from SIS
- Succinct vector, polynomial, and functional commitments from lattices
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- On the impossibility of algebraic vector commitments in pairing-free groups
- Counting vampires: from univariate sumcheck to updatable ZK-SNARK
- Inner product functional commitments with constant-size public parameters and openings
- Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
- Proofs for inner pairing products and applications
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- Linear-map vector commitments and their practical applications
- PointProofs, revisited
- On the impossibility of algebraic NIZK in pairing-free groups
- Concise Mercurial Subvector Commitments: Definitions and Constructions
- On black-box knowledge-sound commit-and-prove SNARKs
- Chainable functional commitments for unbounded-depth circuits
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
- Lattice-based functional commitments: fast verification and cryptanalysis
- Zero-knowledge functional elementary databases
- Updatable, aggregatable, succinct mercurial vector commitment from lattice
- Vector commitments with proofs of smallness: short range proofs and more
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Functional commitments for arbitrary circuits of bounded sizes
- Straight-line knowledge extraction for multi-round protocols
- Fully homomorphic encryption with chosen-ciphertext security from LWE
- Traceable verifiable random functions
- Black-box constant-round secure 2PC with succinct communication
- Zero-knowledge RAM: doubly efficient and black-box
- New techniques for preimage sampling: improved NIZKs and more from LWE
- Lattice-based succinct mercurial functional commitment for Boolean circuits: definitions, and constructions
- Hybrid zero-knowledge from garbled circuits
- Commit-and-prove system for vectors and applications to threshold signing
- Jackpot: non-interactive aggregatable lotteries
- Non-malleable subvector commitments
- Fully dynamic group signatures from subset difference methods under simple assumptions
- Identity-based trapdoor mercurial commitments and applications
- Lower bounding update frequency in short accumulators and vector commitments
- Foundations of data availability sampling
- Anonymous reputation systems with revocation, revisited
This page was built for publication: Concise mercurial vector commitments and independent 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 Q3408212)
