Subvector commitments with application to succinct arguments
From MaRDI portal
Publication:2181864
DOI10.1007/978-3-030-26948-7_19zbMath1456.94095OpenAlexW2967946631MaRDI QIDQ2181864
Russell W. F. Lai, Giulio Malavolta
Publication date: 20 May 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-26948-7_19
Related Items (22)
A sub-linear lattice-based submatrix commitment scheme ⋮ UC Updatable Databases and Applications ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ Registered attribute-based encryption ⋮ \textsf{Dew}: a transparent constant-sized polynomial commitment scheme ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups ⋮ On the impossibility of algebraic vector commitments in pairing-free groups ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ Inner product functional commitments with constant-size public parameters and openings ⋮ Lower bound on SNARGs in the random oracle model ⋮ 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 ⋮ Succinct functional commitment for a large class of arithmetic circuits ⋮ KVaC: key-value commitments for blockchains and beyond ⋮ Incrementally aggregatable vector commitments and applications to verifiable decentralized storage ⋮ Non-malleable vector commitments via local equivocability ⋮ Vector and functional commitments from lattices ⋮ Non-malleable vector commitments via local equivocability ⋮ Efficient range proofs with transparent setup from bounded integer commitments
This page was built for publication: Subvector commitments with application to succinct arguments
