Identity-based Encryption from the Diffie-Hellman Assumption
- 22 March 2021
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 68 (3), 1-46
- https://doi.org/10.1145/3422370
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.Keywords
Funding Information
- AFOSR Award (FA9550-19-1-0200)
- AFOSR YIP Award (FA9550-15-1-0274)
- DARPA/ARL SAFEWARE Award (W911NF15C0210)
- NSF SaTC Award (1936826)
- NSF CRII Award (1464397)
This publication has 48 references indexed in Scilit:
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple AssumptionsLecture Notes in Computer Science, 2009
- A Proof of Security of Yao’s Protocol for Two-Party ComputationJournal of Cryptology, 2008
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer methodMathematics of Computation, 2002
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- Discrete Logarithms in $GF ( P )$ Using the Number Field SieveSIAM Journal on Discrete Mathematics, 1993
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- A key distribution system equivalent to factoringJournal of Cryptology, 1988
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976