E-mail senden E-Mail Adresse kopieren

Identity-based Encryption from the Diffie-Hellman Assumption


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.



Letztes Änderungsdatum

2022-05-02 08:01:07