Pages that link to "Item:Q2692375"
From MaRDI portal
The following pages link to Incrementally aggregatable vector commitments and applications to verifiable decentralized storage (Q2692375):
Displaying 19 items.
- Aggregatable subvector commitments for stateless cryptocurrencies (Q2106630) (← links)
- Merkle trees optimized for stateless clients in bitcoin (Q2670863) (← links)
- Non-malleable vector commitments via local equivocability (Q2697900) (← links)
- Vector and functional commitments from lattices (Q2697903) (← links)
- Verifiable Computation over Large Database with Incremental Updates (Q2985269) (← links)
- Non-malleable vector commitments via local equivocability (Q6054731) (← links)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- On the impossibility of algebraic vector commitments in pairing-free groups (Q6114273) (← links)
- Inner product functional commitments with constant-size public parameters and openings (Q6134851) (← links)
- Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers (Q6134857) (← links)
- New unbounded verifiable data streaming for batch query with almost optimal overhead (Q6173295) (← links)
- Linear-map vector commitments and their practical applications (Q6175974) (← links)
- PointProofs, revisited (Q6175975) (← links)
- Concise Mercurial Subvector Commitments: Definitions and Constructions (Q6488391) (← links)
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces (Q6604928) (← links)
- Lattice-based functional commitments: fast verification and cryptanalysis (Q6604929) (← links)
- Efficient secure storage with version control and key rotation (Q6605322) (← links)
- Vector commitments with proofs of smallness: short range proofs and more (Q6635763) (← links)
- Functional commitments for arbitrary circuits of bounded sizes (Q6651898) (← links)
