[PDF] Top 20 A Zero-Knowledge Version of vSQL

... introduced vSQL, a system for verifying the execution of arbitrary SQL queries over outsourced ...of knowledge for NP, which is succinct if the circuit is “parallelizable” ...of vSQL is its improved ... See full document

... If zero knowledge proofs or arguments are also “proof of knowledge”, it is known as zero knowledge proofs or arguments of knowledge (ZKPoK or ...of knowledge. The ... See full document

... Delegation of Computation. However, most of these complex cryptographic primitives, such as anony- mous authentications and DAAs, achieve their ultimate impact when implemented on portable and mobile devices. This ... See full document

... our knowledge, constructing designated-verifier zero-knowledge proof systems whose soundness is maintained after polynomially many interactions with the prover remains an open ... See full document

... Cramer and Damg˚ard [15] show that OR proofs can be used to construct an identification scheme resilient against man-in-the-middle attacks. Both parties are assumed to have elements in the domain of a homomorphic one-way ... See full document

... We first notice that, although the simulator can use equivocality without extraction as shown above, it is not easy for the simulator to use equivocality for simulating prover’s messages. This is because when the ... See full document

... Fiat and Shamir proposed in 1986 a technique to create Non-Interactive Zero Knowledge Proof (NIZK) based on Interactive Zero Knowledge Proof like Σ-protocols. We can use the Fiat-Shamir ... See full document

... strategy beforehand, but are unable to communicate once the interaction with V starts, then all languages in NP can be proved in a (statistical) zero-knowledge way without any computational assumption. ... See full document

... With this decomposition, ZKB then uses the MPC-in-the-head technique to prove knowledge of x. The prover simulates n independent runs of the three player MPC protocol and commits to the views – 3 views per run. ... See full document

... Second, we build on these components to achieve a distributed zkSNARK. Merely assembling these components into a zkSNARK as in prior monolithic systems, however, does not yield good efficiency. zkSNARKs transform the ... See full document

... Abstract. Verification of a polynomial’s evaluation in a secret committed value plays a role in cryptographic applications such as non-membership or member- ship proofs. We construct a novel special honest verifier ... See full document

... Abstract. We present an efficient method for answering one-dimensional range and closest-point queries in a verifiable and privacy-preserving manner. We consider a model where a data owner out- sources a dataset of ... See full document

... Organization. First, we formally introduce the notion of implicit zero-knowledge proofs (iZK) in Section 2. Second, in Section 3, we discuss some difficulties related to the construction of iZK from SPHF ... See full document

... In cryptography, when designing privacy-sensitive applications, the use of commitments and corresponding zero- knowledge proofs is often indispensable. They allow a prover to convince a verifier that a ... See full document

... (perfect) zero-knowledge argument system with sub-logarithmic round- complexity in a mild relaxation of the standard model; we refer to this as the Bounded Player ...perfect zero-knowledge ... See full document

... Generic constructions for Zero-knowledge are starting to emerge. The recent line of work starting with [14] focus on the novel idea of using garbled circuits for Zero-knowledge proofs of ... See full document

... This allows the client to delegate its input to the untrusted server while still being able to execute the CMT verifier. Supporting Auxiliary Inputs. In order to leverage the efficiency improvements provided by ... See full document

... the zero-knowledge requirement, it is assumed that the prover P is able to keep its internal state — the witness and the random coins — perfectly hidden from the verifier V ∗ ...leakage-resilient ... See full document

... Abstract. Since the invention of the Rubik’s cube by Ern¨ o Rubik in 1974, similar puzzles have been produced, with various number of faces or stickers. We can use these toys to define several problems in computer ... See full document

... BB version of Theorem 1, by computing the commitment of M using our BB size-hiding commitment stage (via extendable Merkle ...the zero-knowledge ... See full document