Practical subvector commitments with optimal opening complexity
From MaRDI portal
Cites work
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Advances in Cryptology - EUROCRYPT 2004
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
- Aggregatable subvector commitments for stateless cryptocurrencies
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Constant-Size Commitments to Polynomials and Their Applications
- Group signatures with almost-for-free revocation
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- KVaC: key-value commitments for blockchains and beyond
- Linear-map vector commitments and their practical applications
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- PointProofs, revisited
- Signatures of correct computation
- Subvector commitments with application to succinct arguments
- Succinct vector, polynomial, and functional commitments from lattices
- The algebraic group model and its applications
- The hunting of the SNARK
- Tight proofs of space and replication
- Updatable and universal common reference strings with applications to zk-SNARKs
- Vector commitments and their applications
- Verifiable delegation of computation over large datasets
- Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
This page was built for publication: Practical subvector commitments with optimal opening complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411905)
