We propose a three-party model for maintaining a dynamic data structure that supports verifiable and privacy-preserving zero-knowledge queries. We give efficient constructions supporting this model for order queries on data organized in lists, trees, and partially-ordered sets of bounded dimension.

Folding, in the context of zero-knowledge proofs, refers to a technique used to reduce the size and complexity of a problem or computation in order to make it more efficient to prove and verify.

1. Introduction and Overview of Zero-Knowledge Proofs Zero-knowledge proofs are a very interesting and fascinating cryptographic concept and prove to be useful in various applications, mainly in privacy and blockchain technology. Zero-knowledge proofs involve two parties: a prover and a verifier. The prover makes an assertion that his or her proof is valid, which the verifier must approve ...

Zero-Knowledge without Proof: Optimal matching Right now, other companies try to abstract the purely transactional nature of networking away, we aim to embrace it by making the transactional nature of this interaction obvious.

Our first model, called zero-knowledge list (ZKL), generalizes the standard two-party model of membership queries on a set to order queries on a list in zero-knowledge. We present a construction of ZKL based on zero-knowledge sets and a homomorphic integer commitment.

The zero-knowledge property can also be relaxed to be computational zero-knowledge if we only require that the probability distributions of the output of the simulator and the transcript of the real protocol are computationally indistinguishable.

We show how to provide privacy-preserving (zero-knowledge) answers to order queries on network data that is organized in lists, trees, and partially-ordered sets of bounded dimension. Our methods are efficient and dynamic, in that they allow for updates in the ordering information while also providing for quick and verifiable answers to queries that reveal no information besides the answers to ...

As such, we believe that a focus on zero-shot knowledge transfer is justified, and our paper makes the following contributions: 1) we propose a novel adversarial algorithm that distills a large teacher into a smaller student without any data or metadata, 2) we show its effectiveness on two common datasets, and 3) we define a measure of belief match between two networks in the vicinity of one ...

The answer is zero-knowledge proofs (ZKPs), developed by computer scientists and mathematicians who acknowledge they are counterintuitive, and now are beginning to move out of the sphere of theoretical computer science, through the realm of possibility and into practical commercial applications.

Knowledge graphs (KGs) provide information in machine interpretable form. In cases where multiple KGs are used in the same system, that information needs to be integrated. This is usually done by automated matching systems. Most of those systems consider only 1:1 (binary) matching tasks. Thus, matching a larger number of knowledge graphs with such systems would lead to quadratic efforts. In ...