Groth16

From zkstacks
Revision as of 13:10, 14 October 2020 by Srikar (talk | contribs)
Jump to navigation Jump to search

Key points about Groth16:

  • Uses Asymmetric Bilinear Pairings (can be instantiated with any type of pairings). Asymmetric setting is more efficient.
  • It is a NIZK for Artithmetic Satisfiability.
  • The Proof only needs 3 group elements.
  • The Verifier only needs to check a single pairing equation and compute a number of exponentiations proportional to the statement size.
  • Perfect completeness and perfect zero-knowledge.
  • Relies on a security proof in the generic bilinear group.

How it Works:

Performance:

Retrieved from "http://161.35.113.184/index.php?title=Groth16&oldid=100"