Identity-based encryption from the Diffie-Hellman assumption

DOI10.1007/978-3-319-63688-7_18zbMath1385.94033OpenAlexW2729240356MaRDI QIDQ1675739

Publication date: 3 November 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-63688-7_18

Related Items (48)

Generic Constructions of Revocable Identity-Based Encryption ⋮ Master-Key KDM-Secure IBE from Pairings ⋮ Registration-based encryption: removing private-key generator from IBE ⋮ A simple construction of iO for Turing machines ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Functional encryption for Turing machines with dynamic bounded collusion from LWE ⋮ Non-interactive batch arguments for NP from standard assumptions ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ An improved affine equivalence algorithm for random permutations ⋮ Anonymous IBE, leakage resilience and circular security from new assumptions ⋮ Optimal bounded-collusion secure functional encryption ⋮ Adaptively secure garbling schemes for parallel computations ⋮ Forward-secure revocable identity-based encryption ⋮ Bounded Collusion ABE for TMs from IBE ⋮ Efficient laconic cryptography from learning with errors ⋮ Unique-path identity based encryption with applications to strongly secure messaging ⋮ Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey ⋮ Identity-based encryption in DDH hard groups ⋮ On Constructing Pairing-Free Identity-Based Encryptions ⋮ IBE with incompressible master secret and small identity secrets ⋮ Bounded functional encryption for Turing machines: adaptive security from general assumptions ⋮ Forward-secure encryption with fast forwarding ⋮ Sublinear secure computation from new assumptions ⋮ Universal amplification of KDM security: from 1-key circular to multi-key KDM ⋮ How to build a trapdoor function from an encryption scheme ⋮ To label, or not to label (in generic groups) ⋮ Lower bounds for the number of decryption updates in registration-based encryption ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ Non-committing encryption with constant ciphertext expansion from standard assumptions ⋮ Cryptographic group actions and applications ⋮ Laconic private set intersection and applications ⋮ Amortizing rate-1 OT and applications to PIR and PSI ⋮ Updatable public key encryption in the standard model ⋮ On the impossibility of purely algebraic signatures ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Efficient identity-based encryption with hierarchical key-insulation from HIBE ⋮ Functional encryption for cubic polynomials and implementation ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Simple and generic constructions of succinct functional encryption ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Non-interactive zero knowledge from sub-exponential DDH ⋮ Generic construction of server-aided revocable hierarchical identity-based encryption ⋮ New constructions of hinting PRGs, OWFs with encryption, and more ⋮ Verifiable registration-based encryption ⋮ New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings ⋮ Dynamic decentralized functional encryption ⋮ Chosen ciphertext security from injective trapdoor functions

This page was built for publication: Identity-based encryption from the Diffie-Hellman assumption