Pages that link to "Item:Q5451070"
From MaRDI portal
The following pages link to Updatable Zero-Knowledge Databases (Q5451070):
Displaying 26 items.
- Verifiable random functions: relations to identity-based key encapsulation and new constructions (Q744351) (← links)
- On the impossibility of structure-preserving deterministic primitives (Q1715860) (← links)
- Impossibility on tamper-resilient cryptography with uniqueness properties (Q2061927) (← links)
- Zero-knowledge elementary databases with more expressive queries (Q2289211) (← links)
- Mercurial commitments with applications to zero-knowledge sets (Q2377062) (← links)
- Publicly verifiable databases with efficient insertion/deletion operations (Q2396817) (← links)
- Vector and functional commitments from lattices (Q2697903) (← links)
- Verifiable Random Functions from Standard Assumptions (Q2796131) (← links)
- Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees (Q2827721) (← links)
- Zero-Knowledge Accumulators and Set Algebra (Q2953773) (← links)
- Verifiable Computation over Large Database with Incremental Updates (Q2985269) (← links)
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs (Q3408212) (← links)
- Statistically Hiding Sets (Q3623038) (← links)
- Verifiable Random Functions from Identity-Based Key Encapsulation (Q3627457) (← links)
- Vector Commitments and Their Applications (Q4916001) (← links)
- UC Updatable Databases and Applications (Q5048962) (← links)
- Zero-Knowledge Sets with Short Proofs (Q5458606) (← links)
- Automata, Languages and Programming (Q5466536) (← links)
- Functional commitments for all functions, with transparent setup and from SIS (Q6063522) (← links)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers (Q6134857) (← links)
- Rotatable zero knowledge sets. Post compromise secure auditable dictionaries with application to key transparency (Q6135447) (← links)
- The price of verifiability: lower bounds for verifiable random functions (Q6169431) (← links)
- Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More (Q6488375) (← links)
- Zero-knowledge functional elementary databases (Q6604931) (← links)
- Updatable, aggregatable, succinct mercurial vector commitment from lattice (Q6635762) (← links)
