Affiliation:
1. Helmholtz Center for Information Security (CISPA), Germany
2. University of California, Berkeley
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference78 articles.
1. Shweta Agrawal and Xavier Boyen. 2009. Identity-based encryption from lattices in the standard model. Manuscript. Retrieved from http://www.cs.stanford.edu/ xb/ab09/. Shweta Agrawal and Xavier Boyen. 2009. Identity-based encryption from lattices in the standard model. Manuscript. Retrieved from http://www.cs.stanford.edu/ xb/ab09/.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献