Introduction Zero Knowledge Proofs (ZKP) protocols allows one person to convince another one of some fact without reveling any information about the proof. e.i. A person "A" or "prover" convince a person "B" or "verifier" that $x$ possess some specific property, but at the end of the protocol, the verifier has no idea of how to prove by itself that indeed $x$ possess such a property. There exists many different flavours of these protocols. One criteria of classification are the schemes who are interactive and those who are non-interactive. Nowadays Non-interactive ZKP schemes have generated a great interest, since they eliminate steps of exchange of information between the parties, this accelerates the protocol and might reduce the probabilities of flaw due to sending messages through channels that can either be or turned insecure. On this branch there are several classes of non-interactive ZKPs that fulfil that criteria, including: Non-interactive Zero-Knowledge Arguments (NIZKs) Succinct Non-interactive Zero-Knowledge Arguments (SNARGs) Succinct Non-interactive Zero-Knowledge Arguments of Knowledge (SNARKs or sometimes zkSNARKs) The last class, zkSNARKs has become very popular among the cryptocurrencies due to their succinctness and efficiency, however is important to mention that these kinds of protocols necessitate a initial setup, usually called "Common Reference String (CRS)" as a public parameter for proving and verifying. This CRS must be generated in advance by a trusted party. The information used to create the CRS, called ‘toxic waste’ needs to be destroyed as soon as the CRS is created. Otherwise, it can be used by adversaries to forge fraudulent proofs.

General Blockchain Concepts Do you need a Blockchain? Bitcoin Original Paper Ethereum White Paper Ethereum Beige Paper Ethereum Yellow Paper Zero Knowledge Proofs Zero-Knowledge Proofs Starter Pack