Skip to content

Update eip-0011.md #10

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

Merged
merged 1 commit into from
May 26, 2020
Merged

Update eip-0011.md #10

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 eip-0011.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,7 +14,7 @@ Please note that unlike multi-signatures in Bitcoin, threshold signatures in Erg
Sigma Protocols
---------------

A Sigma-protocol is three-step protocol between a prover and a verifier. First, prover is generates (secret) randomness and sends a commitment to it *a* to a verifier. The verifier stores the commitment and sends a random challenge *e* to the prover. Prover generates a response *z* based on the randomness and the challenge and sends it to the verifier. Verifier checks the tuple *(a,e,z)* and accepts it if it is valid.
A Sigma-protocol is three-step protocol between a prover and a verifier. First, the prover generates (secret) randomness and sends a commitment to it *a* to a verifier. The verifier stores the commitment and sends a random challenge *e* to the prover. The prover generates a response *z* based on the randomness plus the challenge and sends it to the verifier. The verifier checks the tuple *(a,e,z)* and accepts it if it is valid.

A Sigma-protocol can be converted to a signature scheme by using Fiat-Shamir transformation. Basically, using message *m*, prover can get challenge as *hash(m)* (note that this is the so-called "Weak" Fiat Shamir transform, while Ergo uses the Strong Fiat-Shamir transform, where *e = hash(pk || m)*, and $pk$ is a statement (public key) that the prover is proving).

Expand Down