Aggregatable subvector commitments for stateless cryptocurrencies
From MaRDI portal
Publication:2106630
Recommendations
- Concise Mercurial Subvector Commitments: Definitions and Constructions
- Subvector commitments with application to succinct arguments
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- Linear-map vector commitments and their practical applications
- KVaC: key-value commitments for blockchains and beyond
Cited in
(28)- Subvector commitments with application to succinct arguments
- 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
- SoK: blockchain light clients
- Achieving almost all blockchain functionalities with polylogarithmic storage
- Non-malleable vector commitments via local equivocability
- Succinct vector, polynomial, and functional commitments from lattices
- Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers?
- Linear-map vector commitments and their practical applications
- PointProofs, revisited
- Concise Mercurial Subvector Commitments: Definitions and Constructions
- Limits on revocable proof systems, with implications for stateless blockchains
- From polynomial IOP and commitments to non-malleable zkSNARKs
- Lattice-based functional commitments: fast verification and cryptanalysis
- Vector commitments with proofs of smallness: short range proofs and more
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- Merkle mountain ranges are optimal: on witness update frequency for cryptographic accumulators
- New techniques for preimage sampling: improved NIZKs and more from LWE
- Jackpot: non-interactive aggregatable lotteries
- Non-malleable subvector commitments
- Extractable witness encryption for KZG commitments and efficient laconic OT
- \textsf{Pri}\texttt{FHE}\textsf{te}: achieving full-privacy in account-based cryptocurrencies is possible
- Lower bounding update frequency in short accumulators and vector commitments
- \textsc{Dynark}: making Groth16 dynamic
- Ba\textit{loo}: algebraic lookup arguments
- Structure-preserving compressing primitives: vector commitments and accumulators and applications
This page was built for publication: Aggregatable subvector commitments for stateless cryptocurrencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106630)
