Zero-knowledge elementary databases with more expressive queries
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 informatio...
Saved in:
Main Authors: | Libert, Benoǐt, Nguyen, Khoa, Tan, Benjamin Hong Meng, Wang, Huaxiong |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/142921 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
by: Libert, Benoǐt, et al.
Published: (2020) -
Improving zero-shot learning baselines with commonsense knowledge
by: Roy, Abhinaba, et al.
Published: (2023) -
Zero-knowledge watermark detection resistant to ambiguity attacks
by: Li, Q., et al.
Published: (2013) -
Search condition-hiding query evaluation on encrypted databases
by: Kim, Myungsun, et al.
Published: (2020) -
Multi-point queries in large spatial databases
by: Hoong, K.N., et al.
Published: (2013)