Vector commitments with proofs of smallness: short range proofs and more
From MaRDI portal
Publication:6635763
DOI10.1007/978-3-031-57722-2_2MaRDI QIDQ6635763
Publication date: 12 November 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- The algebraic group model and its applications
- Transparent SNARKs from DARK compilers
- Boosting verifiable computation on encrypted data
- Efficient range proofs with transparent setup from bounded integer commitments
- Aggregatable subvector commitments for stateless cryptocurrencies
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Another look at extraction and randomization of Groth's zk-SNARK
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Subvector commitments with application to succinct arguments
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Short discrete log proofs for FHE and ring-LWE ciphertexts
- TFHE: fast fully homomorphic encryption over the torus
- Succinct functional commitment for a large class of arithmetic circuits
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Vector and functional commitments from lattices
- Composable and Modular Anonymous Credentials: Definitions and Practical Constructions
- QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions
- New Techniques for Non-interactive Shuffle and Range Arguments
- (Leveled) fully homomorphic encryption without bootstrapping
- Constant-Size Commitments to Polynomials and Their Applications
- Pairing-Based Non-interactive Zero-Knowledge Proofs
- Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
- On Ideal Lattices and Learning with Errors over Rings
- Non-interactive Zero-Knowledge Arguments for Voting
- Efficient Protocols for Set Membership and Range Proofs
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Breaking RSA may not be equivalent to factoring
- Computationally Sound Proofs
- Vector Commitments and Their Applications
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Removing the Strong RSA Assumption from Arguments over the Integers
- On the Size of Pairing-Based Non-interactive Arguments
- Advances in Cryptology - ASIACRYPT 2003
- Functional commitments for all functions, with transparent setup and from SIS
- Succinct vector, polynomial, and functional commitments from lattices
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- On the impossibility of algebraic vector commitments in pairing-free groups
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- Inner product functional commitments with constant-size public parameters and openings
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- Linear-map vector commitments and their practical applications
- An analysis of the algebraic group model
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
- Simulation Extractable Versions of Groth’s zk-SNARK Revisited
- Chainable functional commitments for unbounded-depth circuits
This page was built for publication: Vector commitments with proofs of smallness: short range proofs and more
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635763)
