(2021) Identity-based Encryption from the Diffie-Hellman Assumption.
Journal of the ACM.
ISSN 0004-5411
Full text not available from this repository.
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.
| Item Type: | Article |
|---|---|
| Divisions: | Nico Döttling (Cryptographic Algorithms, CA) |
| Depositing User: | Nico Döttling |
| Date Deposited: | 02 May 2022 08:01 |
| Last Modified: | 02 May 2022 08:01 |
| Primary Research Area: | NRA1: Trustworthy Information Processing |
| URI: | https://publications.cispa.saarland/id/eprint/3635 |
Actions
Actions (login required)
 |
View Item |