Recommendations
- Zero-knowledge elementary databases with more expressive queries
- Unlinkable updatable databases and oblivious transfer with access control
- Verifiable computation over large database with incremental updates
- Verifiable Computation over Large Database with Incremental Updates
- Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
- Publicly verifiable databases with efficient insertion/deletion operations
- Public cloud data auditing with practical key update and zero knowledge privacy
- Zero-knowledge proofs of retrievability
- scientific article; zbMATH DE number 1775426
- Zero knowledge with efficient provers
Cited in
(30)- On the impossibility of structure-preserving deterministic primitives
- Impossibility on tamper-resilient cryptography with uniqueness properties
- Zero-knowledge elementary databases with more expressive queries
- Mercurial commitments with applications to zero-knowledge sets
- Publicly verifiable databases with efficient insertion/deletion operations
- Vector and functional commitments from lattices
- Verifiable random functions from standard assumptions
- Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
- Secure database commitments and universal arguments of quasi knowledge
- Zero-Knowledge Accumulators and Set Algebra
- Verifiable Computation over Large Database with Incremental Updates
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Statistically Hiding Sets
- Verifiable Random Functions from Identity-Based Key Encapsulation
- Vector commitments and their applications
- UC Updatable Databases and Applications
- Zero-Knowledge Sets with Short Proofs
- Automata, Languages and Programming
- Functional commitments for all functions, with transparent setup and from SIS
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
- Rotatable zero knowledge sets. Post compromise secure auditable dictionaries with application to key transparency
- The price of verifiability: lower bounds for verifiable random functions
- Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More
- Zero-knowledge functional elementary databases
- Updatable, aggregatable, succinct mercurial vector commitment from lattice
- Lattice-based succinct mercurial functional commitment for Boolean circuits: definitions, and constructions
- Key-homomorphic and aggregate verifiable random functions
- Breaking X-VRF, a post-quantum verifiable random function (short paper)
- Verifiable random functions: relations to identity-based key encapsulation and new constructions
This page was built for publication: Updatable Zero-Knowledge Databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451070)
