Vector Commitments and Their Applications
From MaRDI portal
Publication:4916001
DOI10.1007/978-3-642-36362-7_5zbMath1314.94059OpenAlexW7678451MaRDI QIDQ4916001
Publication date: 19 April 2013
Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36362-7_5
Related Items (46)
A sub-linear lattice-based submatrix commitment scheme ⋮ UC Updatable Databases and Applications ⋮ Somewhere statistically binding commitment schemes with applications ⋮ High-threshold AVSS with optimal communication complexity ⋮ Publicly verifiable databases with efficient insertion/deletion operations ⋮ Decentralized policy-hiding ABE with receiver privacy ⋮ UC priced oblivious transfer with purchase statistics and dynamic pricing ⋮ SoK: blockchain light clients ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ Registered attribute-based encryption ⋮ Private polynomial commitments and applications to MPC ⋮ Zero-Knowledge Accumulators and Set Algebra ⋮ Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ On the impossibility of algebraic vector commitments in pairing-free groups ⋮ Inner product functional commitments with constant-size public parameters and openings ⋮ Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers ⋮ Lower bound on SNARGs in the random oracle model ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers? ⋮ New unbounded verifiable data streaming for batch query with almost optimal overhead ⋮ Additive-homomorphic functional commitments and applications to homomorphic signatures ⋮ Linear-map vector commitments and their practical applications ⋮ PointProofs, revisited ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ On the impossibility of algebraic NIZK in pairing-free groups ⋮ Succinct functional commitment for a large class of arithmetic circuits ⋮ KVaC: key-value commitments for blockchains and beyond ⋮ Publicly verifiable database scheme with efficient keyword search ⋮ 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 ⋮ Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives ⋮ Zero-Knowledge Authenticated Order Queries and Order Statistics on a List ⋮ Non-malleable vector commitments via local equivocability ⋮ SPARKs: succinct parallelizable arguments of knowledge ⋮ Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees ⋮ UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens ⋮ New constructions of hinting PRGs, OWFs with encryption, and more ⋮ New code-based cryptographic accumulator and fully dynamic group signature
Cites Work
- Unnamed Item
- Unnamed Item
- A general model for authenticated data structures
- Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve
- Group Signatures with Almost-for-Free Revocation
- Constant-Size Commitments to Polynomials and Their Applications
- Optimal Authenticated Data Structures with Multilinear Forms
- Short and Stateless Signatures from the RSA Assumption
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
- Diffie-Hellman Oracles
- Independent Zero-Knowledge Sets
- Security Analysis of the Strong Diffie-Hellman Problem
- Universal Accumulators with Efficient Nonmembership Proofs
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Vector Commitments and Their Applications
- CCured
- Verifiable Delegation of Computation over Large Datasets
- Zero-Knowledge Sets With Short Proofs
- Mercurial Commitments with Applications to Zero-Knowledge Sets
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Updatable Zero-Knowledge Databases
- Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
- Zero-Knowledge Sets with Short Proofs
- Topics in Cryptology – CT-RSA 2005
- Theory of Cryptography
This page was built for publication: Vector Commitments and Their Applications
