Difference between revisions of "Glossary"
Jump to navigation
Jump to search
| (29 intermediate revisions by the same user not shown) | |||
| Line 22: | Line 22: | ||
* [[SNARG]] | * [[SNARG]] | ||
* [[ECRH]] | * [[ECRH]] | ||
| + | * [[Promise Problem]] | ||
| + | * [[Statistical Difference]] | ||
| + | * [[Witness indistinguishability]] | ||
| + | * [[Bilinear Pairing]] | ||
| + | * [[Completeness]] | ||
| + | * [[Auxillary Input ZK]] | ||
| + | * [[Twist Security]] | ||
| + | * [[Weil pairing]] | ||
| + | * [[Miller's Algorithm]] | ||
| + | * [[QAP]] | ||
| + | * [[QSP]] | ||
| + | * [[SSP]] | ||
| + | * [[Progression Free Sets]] | ||
| + | * [[LIP]] | ||
| + | * [[Generic Group Model]] | ||
| + | * [[Type 1 Bilinear Group]] | ||
| + | * [[Type 2 Bilinear Group]] | ||
| + | * [[Type 3 Bilinear Group]] | ||
| + | * [[NILP]] | ||
| + | * [[Paillier Encryption]] | ||
| + | * [[Algebraic Group Model]] | ||
| + | * [[Knowledge of Exponent Assumption]] | ||
| + | * [[Preprocessing SNARK]] | ||
| + | * [[Computation Commitments]] | ||
| + | * [[SXDH assumption]] | ||
| + | * [[Sum-Check Protocol]] | ||
| + | * [[Assistant]] | ||
| + | * [[Inner Product Proof System]] | ||
| + | * [[Bilinear Inner Product Proof System]] | ||
| + | * [[Extractable Polynomial Commitment Scheme]] | ||
| + | * [[Polynomial Commitment Scheme]] | ||
| + | * [[Sum-Check Protocol]] | ||
| + | * [[Non-Falsifiable Assumption]] | ||
| + | * [[Round by Round Soundness]] | ||
| + | * [[IOP]] | ||
| + | * [[Reed Solomon Fingerprinting]] | ||
| + | * [[FRI]] | ||
| + | * [[Kate Commitments]] | ||
| + | * [[DARK]] | ||
| + | * [[Poseidon Hash Function]] | ||
| + | * [[Mimic hash function]] | ||
Latest revision as of 13:39, 5 May 2021
In the zk world, there are many terms and definitions that might not be familiar to the uninitiated reader. This introduces a large hurdle for those interested in this exploding field. This Glossary attempts to bridge that gap.
Glossary
- Zap
- SNARK
- STARK
- BulletProof
- Pedersen Commitment
- Homomorphic encryption
- Arthur-Merlin Games
- Sigma Protocol
- Yao's Millionaire Problem
- Fiat-Shamir Heuristic
- Random Oracle Model
- Public Coin Protocols
- Private Coin Protocols
- Non Interactive Zero Knowledge Proofs (NIZK)
- Standard model
- Common Reference String
- Statistical Soundness
- Computational Soundness
- SNARG
- ECRH
- Promise Problem
- Statistical Difference
- Witness indistinguishability
- Bilinear Pairing
- Completeness
- Auxillary Input ZK
- Twist Security
- Weil pairing
- Miller's Algorithm
- QAP
- QSP
- SSP
- Progression Free Sets
- LIP
- Generic Group Model
- Type 1 Bilinear Group
- Type 2 Bilinear Group
- Type 3 Bilinear Group
- NILP
- Paillier Encryption
- Algebraic Group Model
- Knowledge of Exponent Assumption
- Preprocessing SNARK
- Computation Commitments
- SXDH assumption
- Sum-Check Protocol
- Assistant
- Inner Product Proof System
- Bilinear Inner Product Proof System
- Extractable Polynomial Commitment Scheme
- Polynomial Commitment Scheme
- Sum-Check Protocol
- Non-Falsifiable Assumption
- Round by Round Soundness
- IOP
- Reed Solomon Fingerprinting
- FRI
- Kate Commitments
- DARK
- Poseidon Hash Function
- Mimic hash function
