Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/142921
Title: Zero-knowledge elementary databases with more expressive queries
Authors: Libert, Benoǐt
Nguyen, Khoa
Tan, Benjamin Hong Meng
Wang, Huaxiong
Keywords: Engineering::Computer science and engineering
Issue Date: 2019
Source: Libert, B., Nguyen, K., Tan, B. H. M., & Wang, H. (2019). Zero-knowledge elementary databases with more expressive queries. Proceedings of 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC 2019), 11442, 255-285. doi:10.1007/978-3-030-17253-4_9
Abstract: Zero-knowledge elementary databases (ZK-EDBs) are cryptographic schemes that allow a prover to commit to a set D of key-value pairs so as to be able to prove statements such as “x belongs to the support of D and 𝖣(𝑥)=𝑦” or “x is not in the support of D”. Importantly, proofs should leak no information beyond the proven statement and even the size of D should remain private. Chase et al. (Eurocrypt’05) showed that ZK-EDBs are implied by a special flavor of non-interactive commitment, called mercurial commitment, which enables efficient instantiations based on standard number theoretic assumptions. On the other hand, the resulting ZK-EDBs are only known to support proofs for simple statements like (non-)membership and value assignments. In this paper, we show that mercurial commitments actually enable significantly richer queries. We show that, modulo an additional security property met by all known efficient constructions, they actually enable range queries over keys and values – even for ranges of super-polynomial size – as well as membership/non-membership queries over the space of values. Beyond that, we exploit the range queries to realize richer queries such as k-nearest neighbors and revealing the k smallest or largest records within a given range. In addition, we provide a new realization of trapdoor mercurial commitment from standard lattice assumptions, thus obtaining the most expressive quantum-safe ZK-EDB construction so far.
URI: https://hdl.handle.net/10356/142921
ISBN: 9783030172527
DOI: 10.1007/978-3-030-17253-4_9
Rights: © 2019 International Association for Cryptologic Research. All rights reserved. This paper was published by Springer in Proceedings of 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC 2019) and is made available with permission of International Association for Cryptologic Research.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Conference Papers

Files in This Item:
File Description SizeFormat 
Zero-Knowledge Elementary Databases with More Expressive Queries.pdf676.91 kBAdobe PDFView/Open

SCOPUSTM   
Citations 50

3
Updated on Jan 28, 2023

Page view(s)

280
Updated on Jan 30, 2023

Download(s) 50

21
Updated on Jan 30, 2023

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.