Zero-knowledge elementary databases with more expressive queries

DOI10.1007/978-3-030-17253-4_9OpenAlexW2932191090MaRDI QIDQ2289211

Benjamin Hong Meng Tan, Benoît Libert, Khoa Nguyen, 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

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

Related Items (3)

\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 ⋮ 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