[PDF] Top 20 Practical Relativistic Zero-Knowledge for NP

... provide Zero-Knowledge ...not zero-knowledge follows from the undesirable fact that dishonest verifiers can discover the (random) colouring of non-edge pairs of nodes in the graph, revealing ... See full document

... of knowledge for NP, which is succinct if the circuit is “parallelizable” ...5–121×. Zero-Knowledge Verifiable ...of knowledge (SNARKs) from quadratic-arithmetic programs can be made ... See full document

... An NP relation R is a set (x, w) of pairs of inputs x and witnesses w, for which deciding if (x, w) ∈ R can be checked in time polynomial in the length of ... See full document

... Abstract. We study the round complexity of zero-knowledge (ZK) proof systems. While five round ZK proofs for NP are known from standard assumptions [Goldreich-Kahan, J. Cryptology’96], Katz [TCC’08] ... See full document

... a Zero-Knowledge authentication from a solution of any set of multivariate poly- nomials of degree d over a finite field ...For practical applications the case d = 3 ...design ... See full document

... and practical aspects of zero- knowledge proofs for cluster ...computations. Zero-knowledge proofs are useful even when applied to relatively-small computations, and even with high ... See full document

... of zero-knowledge proofs, called instance- dependent zero-knowledge, and show that it suffices for the [8] approach when constructing a compiler from honest-verifier statistical ... See full document

... One-message zero-knowledge with super-polynomial simulation can be constructed against uniform provers, assuming uniform collision-resistant keyless hash functions [BP04a], or against non-uniform verifiers, ... See full document

... As mentioned, our starting point towards achieving malicious security is the recent work by Boneh et al. [BBC + 19], which introduced the new notion of zero-knowledge proofs over distributed data. Such ... See full document

... current zero-knowledge protocol require at least ( log n) ...non-malleable zero- knowledge ...malleable zero-knowledge argument system for NP in the Bare Public-Key ... See full document

... BPP NP sender, so any improvement to that commitment scheme in these respects would have an analogous impact on ...concurrent zero knowledge ... See full document

... of zero-knowledge proofs has been studied in many works, and in some cases, extremely efficient zero-knowledge proofs have been ...For NP complete problems such as Boolean circuit ... See full document

... all practical purposes, while the more recent ones either yield witnesses that grow logarithmically with the size of X or rely on algebraic groups, the use of which is not yet common in ...from ... See full document

... consider zero knowledge proofs in the presence of leakage on the local state of the prover, and present a leakage- resilient-zero-knowledge proof system for HC (Hamiltonian Cycle) ... See full document

... As noted earlier, our reduction requires the existence of Z -auxiliary diO for the class of all polynomial size Turing machines which accept inputs of arbitrary polynomial length (in n) and halt within polynomial steps ... See full document

... leakage-resilient zero-knowledge (LRZK) such that in the setting where adversarial verifiers can obtain arbitrary leakage on the internal state (including the witness and the random coins) of the honest ... See full document

... Another method for constructing non-interactive zero-knowledge proofs is via the Fiat-Shamir heuristic [FS86], for reducing interaction in (public-coin) interactive proofs. Loosely speaking, the Fiat-Shamir ... See full document

... When verifying that the modified protocol still constitutes an interactive proof system for graph nonisomorphism, we have to show that the information revealed by the verifier in Step (V[r] ... See full document

... We view this theorem as an avenue to constructing efficient secret sharing schemes for languages L outside L : namely, to construct a secret-sharing scheme for A L,n , it suffices to con[r] ... See full document

... of knowledge are fundamental notions and powerful tools in ...a zero-knowledge proof system [GMR89], a prover convinces a verifier that some statement is true while leaking nothing but the validity ... See full document