Zero-knowledge elementary databases with more expressive queries

DOI10.1007/978-3-030-17253-4_9MaRDI QIDQ2289211zbMATH OpenOpenAlexFDO

Authors Benoît Libert, Hoa Nguyen, Benjamin Hong Meng Tan, Huaxiong Wang

Publication date 28 January 2020

Full work available at URL https://hal.inria.fr/hal-02151645/file/zk-eedb.pdf

zbMATH Keywords

expressive querieslattice-based commitmentszero-knowledge databases

Mathematics Subject Classification ID

Cryptography (94A60) Searching and sorting (68P10)

Recommendations

• Updatable Zero-Knowledge Databases
• Zero knowledge with efficient provers
• Zero-knowledge protocols for search problems
• On the deductive security of queries to databases with multi-bit records
• Verifiable zero-knowledge order queries and updates for fully dynamic lists and trees
• On Efficient Zero-Knowledge PCPs
• Zero-Knowledge Accumulators and Set Algebra
• Zero knowledge protocols from succinct constraint detection
• Secure database commitments and universal arguments of quasi knowledge
• Zero-knowledge proofs of retrievability

Cited in

(7)

• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
• Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
• Zero-knowledge functional elementary databases
• Updatable Zero-Knowledge Databases
• Updatable, aggregatable, succinct mercurial vector commitment from lattice
• \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices

This page was built for publication: Zero-knowledge elementary databases with more expressive queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289211)