Vector commitments and their applications
From MaRDI portal
Recommendations
- Linear-map vector commitments and their practical applications
- Vector and functional commitments from lattices
- Concise Mercurial Subvector Commitments: Definitions and Constructions
- Non-malleable vector commitments via local equivocability
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
Cites work
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 1394309 (Why is no real title available?)
- A general model for authenticated data structures
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- CCured, type-safe retrofitting of legacy code
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Constant-Size Commitments to Polynomials and Their Applications
- Diffie-Hellman Oracles
- Group signatures with almost-for-free revocation
- Independent Zero-Knowledge Sets
- Mercurial Commitments with Applications to Zero-Knowledge Sets
- Optimal authenticated data structures with multilinear forms
- Security Analysis of the Strong Diffie-Hellman Problem
- Short and Stateless Signatures from the RSA Assumption
- Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve
- Theory of Cryptography
- Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
- Topics in Cryptology – CT-RSA 2005
- Universal Accumulators with Efficient Nonmembership Proofs
- Updatable Zero-Knowledge Databases
- Vector commitments and their applications
- Verifiable delegation of computation over large datasets
- Zero-Knowledge Sets With Short Proofs
- Zero-Knowledge Sets with Short Proofs
Cited in
(84)- Publicly verifiable databases with efficient insertion/deletion operations
- New code-based cryptographic accumulator and fully dynamic group signature
- Monotone policy BARGs from BARGs and additively homomorphic encryption
- Untangling the security of Kilian's protocol: upper and lower bounds
- A sub-linear lattice-based submatrix commitment scheme
- Jackpot: non-interactive aggregatable lotteries
- On black-box knowledge-sound commit-and-prove SNARKs
- Extractable witness encryption for KZG commitments and efficient laconic OT
- Short paper: naysayer proofs
- Limits on revocable proof systems, with implications for stateless blockchains
- Proof of availability and retrieval in a modular blockchain architecture
- Vector barrier certificates and comparison systems
- New unbounded verifiable data streaming for batch query with almost optimal overhead
- Chainable functional commitments for unbounded-depth circuits
- SoK: blockchain light clients
- Vector commitments and their applications
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Lattice-based functional commitments: fast verification and cryptanalysis
- Private polynomial commitments and applications to MPC
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
- Efficient secure storage with version control and key rotation
- Zero-knowledge functional elementary databases
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
- Cryptographic accumulators: new definitions, enhanced security, and delegatable proofs
- Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers?
- PointProofs, revisited
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- High-threshold AVSS with optimal communication complexity
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
- Succinct vector, polynomial, and functional commitments from lattices
- Linear-map vector commitments and their practical applications
- Optimal Byzantine agreement in the presence of message drops
- Functional commitments for all functions, with transparent setup and from SIS
- Registered attribute-based encryption
- Network-agnostic security comes (almost) for free in DKG and MPC
- Quantum rewinding for IOP-based succinct arguments
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Folding schemes with selective verification
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- On the impossibility of algebraic NIZK in pairing-free groups
- Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice
- Oblivious accumulators
- Updatable, aggregatable, succinct mercurial vector commitment from lattice
- Vector commitments with proofs of smallness: short range proofs and more
- Decentralized policy-hiding ABE with receiver privacy
- SPARKs: succinct parallelizable arguments of knowledge
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- Straight-line knowledge extraction for multi-round protocols
- Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
- Fully homomorphic encryption with chosen-ciphertext security from LWE
- Traceable verifiable random functions
- Merkle mountain ranges are optimal: on witness update frequency for cryptographic accumulators
- UC commitments for modular protocol design and applications to revocation and attribute tokens
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Two-round maliciously-secure oblivious transfer with optimal rate
- Inner product functional commitments with constant-size public parameters and openings
- Tightly secure lattice-based synchronized aggregate signature in standard model
- Concise Mercurial Subvector Commitments: Definitions and Constructions
- UC priced oblivious transfer with purchase statistics and dynamic pricing
- UC Updatable Databases and Applications
- Black-box constant-round secure 2PC with succinct communication
- Zero-knowledge RAM: doubly efficient and black-box
- Functional commitments for arbitrary circuits of bounded sizes
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- Certifying private probabilistic mechanisms
- Lattice-based succinct mercurial functional commitment for Boolean circuits: definitions, and constructions
- RSA multiple record parametric authentication scheme
- Somewhere statistically binding commitment schemes with applications
- Universal vector commitments
- KVaC: key-value commitments for blockchains and beyond
- Succinct functional commitment for a large class of arithmetic circuits
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Vector commitments over rings and compressed -protocols
- Zero-Knowledge Accumulators and Set Algebra
- Non-malleable vector commitments via local equivocability
- Vector and functional commitments from lattices
- On the impossibility of algebraic vector commitments in pairing-free groups
- Non-malleable vector commitments via local equivocability
- Lower bound on SNARGs in the random oracle model
- Publicly verifiable database scheme with efficient keyword search
- New constructions of hinting PRGs, OWFs with encryption, and more
This page was built for publication: Vector commitments and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916001)
