Updatable Zero-Knowledge Databases

DOI10.1007/11593447_10zbMath1154.94468OpenAlexW1553673568MaRDI QIDQ5451070

Moses Liskov

Publication date: 18 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11593447_10

zbMATH Keywords

protocolszero-knowledgecommitmentszero-knowledge setszero-knowledge databasestransparent updatesupdatable commitments

Mathematics Subject Classification ID

Database theory (68P15) Authentication, digital signatures and secret sharing (94A62)

Related Items (17)

UC Updatable Databases and Applications ⋮ Mercurial commitments with applications to zero-knowledge sets ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ Zero-Knowledge Accumulators and Set Algebra ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Vector and functional commitments from lattices ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Vector Commitments and Their Applications ⋮ Verifiable Random Functions from Standard Assumptions ⋮ Zero-Knowledge Sets with Short Proofs ⋮ Statistically Hiding Sets ⋮ Verifiable random functions: relations to identity-based key encapsulation and new constructions ⋮ Verifiable Random Functions from Identity-Based Key Encapsulation ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees ⋮ Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs

This page was built for publication: Updatable Zero-Knowledge Databases