Security, Zero Knowledge Proofs, Snark, Cryptography, Research.
system and argue it is meeting the above properties. Completeness is shown by a simple equivalence reformulation: ∀r,e : gᶻ = gʳ⁺ᵉʷ = gʳ(gʷ)ᵉ = axᵉ Special soundness is shown in Figure 4 by constructing the extractor E that computes the correct witness w and thus breaks the discrete log assumption