Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
From MaRDI portal
Publication:3408212
DOI10.1007/978-3-642-11799-2_30zbMath1274.94093OpenAlexW1728441211MaRDI QIDQ3408212
Benoît Libert, Mordechai M. Yung
Publication date: 24 February 2010
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_30
Related Items (29)
UC Updatable Databases and Applications ⋮ Somewhere statistically binding commitment schemes with applications ⋮ High-threshold AVSS with optimal communication complexity ⋮ UC priced oblivious transfer with purchase statistics and dynamic pricing ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ Zero-Knowledge Accumulators and Set Algebra ⋮ 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 ⋮ 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 ⋮ Vector Commitments and Their Applications ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Identity-based trapdoor mercurial commitments and applications ⋮ Zero-Knowledge Authenticated Order Queries and Order Statistics on a List ⋮ Non-malleable vector commitments via local equivocability ⋮ Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys ⋮ Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees ⋮ Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes
Cites Work
- New approaches for deniable authentication
- Independent Zero-Knowledge Sets
- Security Analysis of the Strong Diffie-Hellman Problem
- Universally Composable Security with Global Setup
- Programmable Hash Functions and Their Applications
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Statistically Hiding Sets
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Financial Cryptography
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Mercurial Commitments with Applications to Zero-Knowledge Sets
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Pairing-Friendly Elliptic Curves of Prime Order
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Updatable Zero-Knowledge Databases
- Zero-Knowledge Sets with Short Proofs
- Automata, Languages and Programming
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
This page was built for publication: Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
