零知识证明（Zero-Knowledge Proof, ZKP）是一种密码学技术，它允许一方（证明者，Prover）向另一方（验证者，Verifier）证明某一陈述是真实的，而无需透露除了该陈述为真之外的任何额外信息。换句话说，零知识证明允许证明者证明他们知道一个秘密，而不需要透露这个秘密的任何信息。举个简单的例子，假设您要向朋友证明您知道某个秘密
The example provides a clear impression of the working ofzero-knowledge proofswith an impression of their essential traits. First of all, it is important to note the feature of completeness in the highlighted zero-knowledge proof example. The example clearly shows that Sam could demonstrate the tr...
在密码学中,零知识证明(zero-knowledge proof)或零知识协议(zero-knowledge protocol)是一种方法,通过该方法,一方(the prover, 证明者)可以向另一方(the verifier, 证明者)证明他们知道值x,而无需传达任何信息,除了他们知道值x。零知识证明的本质是,通过简单地揭示信息来证明某人具有某些信息的知识是微不足道的。...
“Soundness”If statement false, no matter what proof π* prover cooks up, verifier should detect the lie with high probability. Note: To achieve Zero Knowledge Proofs, sometimes prover and verifier have to “talk” in multiple rounds. Here is a simple example of Zero Knowledge Proofs. Assumin...
小明和小红之间最开始那种互动式的证明方法暗指的是交互式零知识证明（interactive zero-knowledge proof）。交互式零知识证明需要验证方（小红）在证明方（小明）放好答案（commitment）后，不断的发送随机试验。如果验证和证明双方事先串通好，那么他们就可以在不知道真实答案的情况下开挂（simulate/forge a proof）。...
Zero-knowledge proof是一种证明技巧, 用于一方向另一方证明我拥有某种资源或掌握某种知识,但并不直接展示资源/知识。 Zero-knowledge proof是一种用于verification的证明技巧,这种证明有时可以不保证100%的正确性。 例如,A想向B证明他拥有一个房屋的大门钥匙。
小明和小红之间最开始那种互动式的证明方法暗指的是交互式零知识证明(interactive zero-knowledge proof)。交互式零知识证明需要验证方(小红)在证明方(小明)放好答案(commitment)后,不断的发送随机试验。如果验证和证明双方事先串通好,那么他们就可以在不知道真实答案的情况下开挂(simulate/forge a proof)。
本篇文章主要介绍零知识证明(Zero-Knowledge Proof, ZKP)相关概念。如果说前面几篇文章介绍的安全计算方法属于场景和用途易于理解只是可行性上有点反常识以及实现方法上有些晦涩,那零知识证明则在应用场景上也有点玄乎了:零知识证明想要解决的问题是,让一方向另一方证明他知道某个问题的答案但却不想透露该问题的具体...
DECENTRALIZED USE OF ZERO KNOWLEDGE PROOF WITH ENHANCED IDENTITY CREDENTIALS TO LOWER EXTERNAL COUNTER PARTY RISKS, FOR EXAMPLE TO COMBAT MONEY LAUNDERINGA cryptocurrency system with a communication channel, a wallet, where the wallet has a paycode and associated private key and the paycode is ...
Second Example: A Color-Blind Friend and Two Balls This type of experiment for zero knowledge proof authentication would require two same sized balls but with different colors. The experiment is really popular. Mike Hearn and Konstantinos Chalkias first introduced this new method. You can also do...