Identity-based encryption from the Diffie-Hellman assumption
发表信息
作者
- Nico Döttling
- Sanjam Garg
笔记
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.
我们首次提供了基于(计算性)Diffie-Hellman问题(不使用配对群)或因子分解问题难度的身份基加密(Identity-based Encryption)和分层身份基加密(Hierarchical Identity-based Encryption)的构造方案。我们的构造实现了Boneh和Franklin [CRYPTO 2001]提出的标准身份基加密概念。通过使用对底层密码学原语进行非黑盒使用的混淆电路(Garbled Circuits)，我们成功绕过了已知的不可能性结果。