Pages that link to "Item:Q1675739"
From MaRDI portal
The following pages link to Identity-based encryption from the Diffie-Hellman assumption (Q1675739):
Displaying 50 items.
- A mechanical approach to derive identity-based protocols from Diffie-Hellman-based protocols (Q507654) (← links)
- An identity-based encryption scheme with compact ciphertexts (Q615206) (← links)
- Registration-based encryption: removing private-key generator from IBE (Q1629445) (← links)
- A simple construction of iO for Turing machines (Q1631340) (← links)
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
- Functional encryption for cubic polynomials and implementation (Q1981766) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- Generic construction of server-aided revocable hierarchical identity-based encryption (Q2057130) (← links)
- Identity-based authenticated encryption with identity confidentiality (Q2067611) (← links)
- New constructions of hinting PRGs, OWFs with encryption, and more (Q2096498) (← links)
- Verifiable registration-based encryption (Q2096501) (← links)
- New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings (Q2096502) (← links)
- Dynamic decentralized functional encryption (Q2096508) (← links)
- Chosen ciphertext security from injective trapdoor functions (Q2096512) (← links)
- Functional encryption for Turing machines with dynamic bounded collusion from LWE (Q2139636) (← links)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption (Q2152147) (← links)
- Optimal bounded-collusion secure functional encryption (Q2175911) (← links)
- Adaptively secure garbling schemes for parallel computations (Q2175942) (← links)
- Efficient identity-based encryption with hierarchical key-insulation from HIBE (Q2232128) (← links)
- ID-based cryptography using symmetric primitives (Q2384045) (← links)
- Forward-secure revocable identity-based encryption (Q2673062) (← links)
- Non-committing encryption with constant ciphertext expansion from standard assumptions (Q2692376) (← links)
- Cryptographic group actions and applications (Q2692390) (← links)
- Laconic private set intersection and applications (Q2697887) (← links)
- Amortizing rate-1 OT and applications to PIR and PSI (Q2697889) (← links)
- Updatable public key encryption in the standard model (Q2697895) (← links)
- On the impossibility of purely algebraic signatures (Q2697897) (← links)
- (Q2951207) (← links)
- (Q4217884) (← links)
- Generic Constructions of Revocable Identity-Based Encryption (Q5040410) (← links)
- Master-Key KDM-Secure IBE from Pairings (Q5041155) (← links)
- Collusion Resistant Traitor Tracing from Learning with Errors (Q5130846) (← links)
- Making the Diffie-Hellman Protocol Identity-Based (Q5189448) (← links)
- Cryptography and Coding (Q5897537) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5915597) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5918098) (← links)
- Simple and generic constructions of succinct functional encryption (Q5918349) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- Bounded Collusion ABE for TMs from IBE (Q6041291) (← links)
- Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey (Q6101318) (← links)
- Identity-based encryption in DDH hard groups (Q6103077) (← links)
- On Constructing Pairing-Free Identity-Based Encryptions (Q6108845) (← links)
- IBE with incompressible master secret and small identity secrets (Q6114253) (← links)
- Bounded functional encryption for Turing machines: adaptive security from general assumptions (Q6114255) (← links)
- Forward-secure encryption with fast forwarding (Q6114263) (← links)
- Sublinear secure computation from new assumptions (Q6114267) (← links)
- How to build a trapdoor function from an encryption scheme (Q6157550) (← links)
