Efficient Identity-Based Encryption Without Random Oracles

Efficient Identity-Based Encryption Without Random Oracles

2005 | Brent Waters
Brent Waters presents the first efficient Identity-Based Encryption (IBE) scheme that is fully secure without random oracles. The scheme is based on the decisional Bilinear Diffie-Hellman (BDH) assumption. The paper also shows how this IBE scheme can be used to construct a secure signature scheme under the computational Diffie-Hellman assumption without random oracles. The IBE scheme is efficient and secure in the standard model, improving upon previous schemes that were either insecure or inefficient. The paper also discusses the extension of the IBE scheme to a hierarchical identity-based encryption (HIBE) scheme and its use in achieving chosen-ciphertext (CCA) security. Additionally, the paper describes a signature scheme derived from the IBE scheme, which is secure under the computational Diffie-Hellman assumption. The security of the IBE and signature schemes is proven using reductions to the BDH and computational Diffie-Hellman assumptions, respectively. The paper concludes by highlighting the importance of efficient and secure IBE schemes without random oracles and identifying open problems in this area.Brent Waters presents the first efficient Identity-Based Encryption (IBE) scheme that is fully secure without random oracles. The scheme is based on the decisional Bilinear Diffie-Hellman (BDH) assumption. The paper also shows how this IBE scheme can be used to construct a secure signature scheme under the computational Diffie-Hellman assumption without random oracles. The IBE scheme is efficient and secure in the standard model, improving upon previous schemes that were either insecure or inefficient. The paper also discusses the extension of the IBE scheme to a hierarchical identity-based encryption (HIBE) scheme and its use in achieving chosen-ciphertext (CCA) security. Additionally, the paper describes a signature scheme derived from the IBE scheme, which is secure under the computational Diffie-Hellman assumption. The security of the IBE and signature schemes is proven using reductions to the BDH and computational Diffie-Hellman assumptions, respectively. The paper concludes by highlighting the importance of efficient and secure IBE schemes without random oracles and identifying open problems in this area.
Reach us at info@study.space
[slides and audio] Efficient Identity-Based Encryption Without Random Oracles