Provably Secure Non-Interactive Key Distribution Based on Pairings

Régis Dupont (1, 2) , Andreas Enge (1, 2)

1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
2 TANC - Algorithmic number theory for cryptology

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.

Mots clés: key distribution; non-interactive; identity based cryptography; pairings; security proof; random oracle model

Domaines: Théorie des nombres [math.NT]

Régis Dupont, Andreas Enge. Provably Secure Non-Interactive Key Distribution Based on Pairings. Discrete Applied Mathematics, 2006, 154 (2), pp.270-276. ⟨inria-00386311⟩