Zero-knowledge proofs, sometimes called ZK protocols, are a method of verification that takes place between a prover and a verifier. So what exactly is zero-knowledge proof and what criteria make up zero-knowledge proofs. Let’s find out by reading the article below.
What is zero-knowledge proof?
A zero-knowledge proof or protocol is a way for a "prover" to convince a "verifier" that a statement about some secret information is true without revealing the secret itself. Proof protocols can be interactive or non-interactive.
Example: A verifier provides a hash H to a prover and expects the prover to provide proof that it owns the secret data with hash H. The prover produces a zero-knowledge proof that convinces the verifier that it owns data H hashed H, without revealing the data itself to the verifier.
What criteria make up zero-knowledge proofs?
A zero-knowledge proof (ZKP) method must satisfy the following conditions:
Integrity: If the information provided by the prover is true, then the ZKP method must enable the verifier to verify that the prover is telling the truth.
Reliability: If the information provided by the prover is false, then the ZKP method must allow the verifier to disprove what the prover said is true.
Zero-knowledge: ZKP methods must reveal to the verifier whether the prover is telling the truth.
What are the different types of zero-knowledge proofs?
There are two main types of zero-knowledge proofs here:
Interactive Zero-Knowledge Proofs: In this type of ZKP, the prover and verifier interact multiple times. Verifiers challenge provers who provide responses to these challenges until the verifier is convinced.
Non-interactive zero-knowledge proofs: In this type of ZKP, the proof submitted by the prover can only be verified by the verifier once at any time. This type of ZKP requires more computing power than an interactive ZKP. They are also the most popular due to the ease of user experience.
I hope this article will help you to learn what exactly is zero-knowledge proof and what criteria make up zero-knowledge proofs. Zero-knowledge proof-of-work, aka zero-knowledge proof-of-computation, is when the prover convinces the verifier that he has correctly performed some computation on secret data without revealing the secret.
