Difference between revisions of "Groth16"
Jump to navigation
Jump to search
(Created page with "Key points about Groth16: * It is pairing based") |
|||
| Line 1: | Line 1: | ||
Key points about Groth16: | Key points about Groth16: | ||
| − | * It is pairing | + | * 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: | ||
Revision as of 13:10, 14 October 2020
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:
