Skip to content

Fix terminology #64

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
thomasknauth wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Fix terminology #64

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion docs/Concepts/zkp.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@ A zk-SNARK is a cryptographic construction that allows you to provide a proof of

In addition, verifying a proof is a computational operation which is at worst logarithmic in the size of the mathematical statement (**Succinct**), and the procedure of proving and verifying a proof requires no interaction between the prover and the verifier, except passing the proof to the verifier (**non-interactive**).

If we don't consider **Succinctness**, and if we slightly modify the notion of **Zero knowledge** to **Honest Verifier Zero Knowledge** (which is weaker than the **Zero Knowledge** property), examples of (HV)ZK-NARK are digital signatures algorithms ECDSA and EDDSA, which are in fact applications of the Schnorr Identification Protocol. It is essentially an argument of knowledge to prove knowledge of the discrete log of a point in a group where the discrete log is hard. Verifying such signatures is not computationally costly, but does not verify the **Succinctness** property as it was previously defined.
If we don't consider **Succinctness**, and if we slightly modify the notion of **Zero knowledge** to **Honest Verifier Zero Knowledge** (which is weaker than the **Zero Knowledge** property), examples of (HV)ZK-NARK are digital signatures algorithms ECDSA and EDDSA, which are in fact applications of the Schnorr Identification Protocol. It is essentially an argument of knowledge to prove knowledge of the discrete log of a point in a group where the discrete log is hard. Verifying such signatures is not computationally costly, but does not satisfy the **Succinctness** property as it was previously defined.

The signature schemes are specific mathematical statements, or [**circuits**](circuits.md).

Expand Down