Non-interactive zero-knowledge proof

in zero •  4 years ago 

Content

As the name suggests, the non-interactive proof process does not need to be repeated. This article is sponsored by the Bihu Community (bihu.com) Content Support Program

To

On Weibo, there are always readers asking questions about blockchain going to sea in private messages, so a mustard circle (non-knowledge planet) "Block War" was established to facilitate communication, and the content will be published in it first. Originality is not easy. Because of the limitations of Zhihu and WeChat, you can only scan the code in WeChat to enter. Welcome to click to join. This article is sponsored by the Bihu Community (bihu.com) Content Support Program

To

Therefore, a mustard circle (non-knowledge planet) "Sorry of the Block" was established to facilitate communication and the content will be published in it first. Originality is not easy. Because of the limitations of Zhihu and WeChat, you can only scan the code in WeChat to enter. Welcome to click to join. How to transfer information between the two parties? Let's take Zcash as an example:

Alice wants to transfer a ZEC to Bob. At this time, Alice has a check of 1 ZEC. To transfer the money to Bob, first create a check of 1 ZEC for Bob. At this time, both Alice and Bob have a check.

Both of these "checks" are valid. Alice's check exists in the entire Zcash network from the beginning, and Bob's check will be broadcast to the entire network after it is generated.

In order to hide the information of traders, two checks must be encrypted. The "checks" that exist in the whole network are actually like this.

image.png

Authors get paid when people like you upvote their post.
If you enjoyed what you read here, create your account today and start earning FREE STEEM!