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

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
A minor revision of an IACR publication in CRYPTO 2017
Keywords
Identity-Based Encryption
Contact author(s)
sanjamg @ berkeley edu
History
2017-06-19: last of 2 revisions
2017-06-08: received
See all versions
Short URL
https://ia.cr/2017/543
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2017/543,
      author = {Nico Döttling and Sanjam Garg},
      title = {Identity-Based Encryption from the Diffie-Hellman Assumption},
      howpublished = {Cryptology ePrint Archive, Paper 2017/543},
      year = {2017},
      note = {\url{https://eprint.iacr.org/2017/543}},
      url = {https://eprint.iacr.org/2017/543}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.