Identity-Based Encryption from the Weil Pairing

TLDR

The Weil pairing on elliptic curves is an example of the bilinear map underlying the scheme. The authors propose a fully functional identity‑based encryption scheme and define secure IBE schemes with multiple applications. The scheme is built on bilinear maps between groups, achieves chosen‑ciphertext security in the random‑oracle model, and relies on a variant of the computational Diffie–Hellman problem. The authors present precise definitions of secure IBE schemes and illustrate several practical applications.

Abstract

We propose a fully functional identity-based encryption (IBE) scheme. The scheme has chosen ciphertext security in the random oracle model assuming a variant of the computational Diffie--Hellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic curves is an example of such a map. We give precise definitions for secure IBE schemes and give several applications for such systems.