Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:cryptographic_assumption
|
| gptkbp:describes |
hardness of computing e(g, g)^{abc} given g, g^a, g^b, g^c in a bilinear group
|
| gptkbp:fullName |
Bilinear Diffie-Hellman assumption
|
| gptkbp:introducedIn |
2001
|
| gptkbp:proposedBy |
gptkb:Dan_Boneh
Matt Franklin |
| gptkbp:relatedTo |
gptkb:Decisional_Diffie-Hellman_assumption
gptkb:Diffie-Hellman_problem |
| gptkbp:usedIn |
identity-based encryption
pairing-based cryptography |
| gptkbp:bfsParent |
gptkb:Bilinear_Diffie–Hellman_assumption
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
BDH assumption
|