zero knowledge
Interactive and zero-knowledge proofs
... Proof: To show that the zero-knowledge, it needs protocol to be for verified quadratic residues that given is perfect the input to the proof, the forging algorithm and the original proof[r] ...
117
Efficient Designated-Verifier Non-Interactive Zero-Knowledge Proofs of Knowledge
... our knowledge, this is the most efficient currently known method for proving such statements non-interactively: all previous works on DVNIZKs describe homomorphic-encryption-based compilers for Σ-protocols which ...
34
Constant-Round Leakage-Resilient Zero-Knowledge Arguments of Knowledge for NP
... information f(state). Therefore, to show leakage-resilient zero knowledge property, the simulator should “correctly” respond V ∗ ’s leakage queries. However, owing to without any witness, the simulator does ...
28
Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
... Shamir, zero-knowledge proofs have played a significant role in modern cryptography: they allow a party to convince another party of the validity of a statement (proof of membership) or of its ...
13
DIZK: A Distributed Zero Knowledge Proof System
... Proof systems & distributed systems. While prior work does not distribute the prover’s computation across a cluster, some prior work studied how even monolithic provers can be used to prove correct execution of ...
30
Efficient Threshold Zero-Knowledge with Applications to User-Centric Protocols
... Related Work. Pedersen [41] considers distributed provers in the context of undeniable signatures. However, while our goal is to improve the security against theft of the user’s identity, Pedersen’s focus is on ...
27
Constant-round Leakage-resilient Zero-knowledge from Collision Resistance
... leakage-resilient zero-knowledge argument system for NP under the assumption of the existence of collision-resistant hash function ...constant-round zero-knowledge argument system that has the ...
37
Achieving Constant Round Leakage-Resilient Zero-Knowledge
... 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 ...
28
Zero-Knowledge for Multivariate Polynomials
... a Zero-Knowledge authentication from a solution of any set of multivariate poly- nomials of degree d over a finite field ...design Zero-Knowledge schemes based on the (NP-complete) Morphism ...
23
Concurrent Zero Knowledge in the Bounded Player Model
... a zero-knowledge proof is an interactive proof between two parties — a prover and a verifier — with the seemingly magical property that the verifier does not learn any- thing beyond the validity of the ...
26
Languages with Efficient Zero-Knowledge PCP's are in SZK
... statistical zero-knowledge for all of NP is possible using a single stateless token sent from the prover to the verifier followed by O(1) rounds of classical ...
19
Efficient Post-Quantum Zero-Knowledge and Signatures
... We specify the Share function in this manner as it will lead to more compact zero- knowledge proofs. Moving now to the ZKB protocol, for each round, the prover is required to “open” two views. In order to ...
36
Proposal for Protocol on a Quorum Blockchain with Zero Knowledge
... 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 ...
22
Implementation of Zero Knowledge Protocol in Wireless Security
... of zero knowledge proofs in which prover wants to prove its identity to a verifier through some secret information (such as a password) but never wants that the second party to get anything about this ...by ...
5
Non-Interactive Zero-Knowledge Proofs of Non-Membership
... m). Zero-knowledge proofs of knowledge are two party protocols, which allow a prover to convince a verifier that he knows some secret piece of information, without the verifier being able to learn ...
18
Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting
... Example 6 is not Zero-Knowledge. Actually, with the SPHF from Example 6, no such algorithm iTKG or iTDec (verifying the zero-knowledge property) exists. It is even worse than that: a malicious ...
35
Zero-knowledge Argument for Polynomial Evaluation with Application to Blacklists
... 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 ...
17
Compact Zero-Knowledge Proofs of Small Hamming Weight
... Abstract. We introduce a new technique that allows to give a zero- knowledge proof that a committed vector has Hamming weight bounded by a given constant. The proof has unconditional soundness and is very ...
31
Proving the correct execution of concurrent services in zero-knowledge
... Abstract. This paper introduces Spice, a system for building verifiable state machines (VSMs). A VSM is a request-processing service that produces proofs estab- lishing that requests were executed correctly according to ...
26
Zero Knowledge with Rubik's Cubes and Non-Abelian Groups
... 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 ...
17