[PDF] Top 20 Zero-Knowledge Protocols for Search Problems

... Following is an informal sketch of the proof of IP ⊆ P SP ACE : given an input x, the computation tree that corresponds to the given protocol execution on x is considered. Each node in the i’th level of the tree ... See full document

... these protocols are only computationally hiding or are not resistant against quantum ...(statistical) zero-knowledge protocols and allows to refreshes the binding property over ...in ... See full document

... uses zero knowledge proof protocols as ...cure protocols and standard composition techniques, they are consequently secure and we omit the security proofs of ...for zero ... See full document

... typical zero knowledge protocol involves a prover P eggy which possesses a piece of secret information x associated with her identity and a verifier V ictor whose job is to check that P eggy really owns ... See full document

... Constructions of Efficient Secret-Sharing Schemes. We show new constructions of ef- ficient secret-sharing schemes for languages that are in P but are not known to be in NC, namely Bounded-Degree Graph Isomorphism [27, ... See full document

... Exractability. Finally, we want the commitment scheme to be extractable in the manner described in [6] for the case of collision-resistant functions, i.e., it should not be possible to output a valid commitment without ... See full document

... verifiers. Although this form of commitment is intimately connected to the CHSH game [16] and the Popescu-Rohrlich box[17], this proximity is not relevant for the soundness and the complete- ness of our protocols, ... See full document

... graphic protocols. The original setting of zero-knowledge proofs contemplated a single prover and a single verifier executing a single protocol session in ...Concurrent zero-knowledge ... See full document

... Understanding the communication complexity of information-theoretically secure protocols is a fundamental research problem. Despite much effort, we have very little understanding of the communication complexity of ... See full document

... come as no surprise, since the Q-binding definition itself explicitly refers to a polynomial number of parallel copies of the commitment scheme.) The definition seems particularly well-suited for commit-and-choose ... See full document

... Our scheme extends Stern’s ZKPoK [Ste96] for the Syndrome Decoding Problem (SDP). Stern’s proof system is a 3-move interactive protocol: the prover P computes three commitments and sends them to the verifier V ; verifier ... See full document

... open problems for SZK as well, and in [MV] instance-dependent commitments were proposed as an approach to the question of prover efficiency for ...concurrent zero knowledge ... See full document

... authentication protocols are asymptotically as efficient as number-theoretic ones, their concrete performance is not much good, due to the fact that the former treats “challenge bits” in- dividually, while the ... See full document

... above protocols based on the standard assumptions is at least O(log n) ...current zero-knowledge protocol require at least ( log n) ...non-malleable zero- knowledge ...malleable ... See full document

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

... In an interactive Protocol, there are two entities: the prover and the verifier. The Prover wants to convince the verifier that she knows a secret. Both interact and at the end, the verifier accepts or refuses. In ... See full document

... immunize protocols against malicious behavior. In the context of zero-knowledge, an honest verifier follows the protocol specification using a uniformly random ...preserve ... See full document

... of search theory: (i) search games with mobile hiders, and (ii) rendezvous ...the zero-sum game played between a mobile searcher (minimizer) and a mobile hider (maximizer) in a given region with ... See full document

... these problems, multiple knowledge sources and an inference process capable of mirroring the human thought processes (especially judgment and experience) must be available at the right time to the persons ... See full document

... is knowledge extracted? Traditionally, the basic technique for extracting knowledge from an adversary is to run it on multiple related inputs to deduce what it “knows” from the resulting ...interactive ... See full document