1 - Bilinear Pairings

• definition: bilinearity, non-degeneracy, computability.
• MOV reduction: dlp in G reduced to dlp in GT.
• DDH in G is easy.
• 3-party key-agreement in 1 round.
• necessary assumptions for CBDH and DBDH.