Provably secure non-interactive key distribution based on pairings

Authors:
Régis Dupont;Andreas Enge
Affiliations:
Projet TANC, INRIA Futurs & Laboratoire d'Informatique, ÉÉcole polytechnique, Palaiseau Cedex, France;Projet TANC, INRIA Futurs & Laboratoire d'Informatique, ÉÉcole polytechnique, Palaiseau Cedex, France
Venue:
Discrete Applied Mathematics - Special issue: Coding and cryptography
Year:
2006

Citing 11
Cited 3

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves

Mathematics of Computation
A Non-interactive Public-Key Distribution System

Designs, Codes and Cryptography
Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
Efficient Identity Based Signature Schemes Based on Pairings

SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Modified Maurer-Yacobi`s scheme and its applications

ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
An Identity-Based Signature from Gap Diffie-Hellman Groups

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
A One Round Protocol for Tripartite Diffie-Hellman

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields

Journal of Cryptology
Elliptic Curves Suitable for Pairing Based Cryptography

Designs, Codes and Cryptography
Constructing elliptic curves with prescribed embedding degrees

SCN'02 Proceedings of the 3rd international conference on Security in communication networks

An efficient session key generation for NTDR networks based on bilinear paring

Computer Communications
On the application of pairing based cryptography to wireless sensor networks

Proceedings of the second ACM conference on Wireless network security
On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

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.