Identity-based encryption from the weil pairing

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 e...

Full description

Saved in:
Bibliographic Details
Published inSIAM journal on computing Vol. 32; no. 3; pp. 586 - 615
Main Authors BONEH, Dan, FRANKLIN, Matthew
Format Journal Article
LanguageEnglish
Published Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2003
Subjects
Algebra
Algebraic geometry
Applied sciences
Computer science
Computer science; control theory; systems
Cryptography
Data encryption
Data processing. List processing. Character string processing
Exact sciences and technology
Information, signal and communications theory
Mathematics
Memory organisation. Data processing
Number theory
Public Key Infrastructure
Sciences and techniques of general use
Security management
Service introduction
Signal and communications theory
Software
Telecommunications and information theory
Bilinear map
Weil pairing
Coding
Data processing
Elliptic curve
Cryptography
Decryption
Computer security
Tate pairing
Identity based encryption
Information theory
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0097-5397
1095-7111
DOI:10.1137/s0097539701398521