Zero-knowledge protocols #
Here, we provide uniform, detailed descriptions to several zero-knowledge protocols. We include: necessary setup, security pitfalls and associated severity, safe parameter choices, and original references.
- Schnorr's identification protocol
- The zero-knowledge proof for a discrete-logarithm in a prime modulo.
- Variants of Schnorr's identification protocol
- Common variants of Schnorr’s protocol.
- Number is product of two primes
- Prove that a number is the product of two primes. We show two proofs of this: one for generic primes, and another, more efficient, when primes are congruent with 3 modulo 4.
- Girault's identification protocol
- A statistical zero-knowledge proof for discrete-logarithm in a composite modulo.
- Short factoring proofs
- Proof of knowledge of the factorization of an integer.