Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
420877 | Discrete Applied Mathematics | 2006 | 7 Pages |
Abstract
We define a security notion for non-interactive key distribution protocols. We identify an apparently hard computational problem related to pairings, the Bilinear Diffie–Hellman problem (BDH). After extending Sakai, Ohgishi, and Kasahara's pairing based protocol to a slightly more general setting, we show that breaking the system is polynomially equivalent to solving BDH in the random oracle model and thus establish a security proof.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Régis Dupont, Andreas Enge,