Cryptology ePrint Archive: Report 2017/543

Identity-Based Encryption from the Diffie-Hellman Assumption

Nico Döttling and Sanjam Garg

Abstract: We provide the first constructions of identity-based encryption and hierarchical identity-based encryption based on the hardness of the (Computational) Diffie-Hellman Problem (without use of groups with pairings) or Factoring. Our construction achieves the standard notion of identity-based encryption as considered by Boneh and Franklin [CRYPTO 2001]. We bypass known impossibility results using garbled circuits that make a non-black-box use of the underlying cryptographic primitives.

Category / Keywords: public-key cryptography / Identity-Based Encryption

Original Publication (with minor differences): IACR-CRYPTO-2017

Date: received 5 Jun 2017, last revised 18 Jun 2017

Contact author: sanjamg at berkeley edu

Available format(s): PDF | BibTeX Citation

Version: 20170619:050912 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]