Revocable IBE with En-DKER from lattices: a novel approach for lattice basis delegation

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Generating shorter bases for hard random lattices
Revocable predicate encryption from lattices
Bonsai trees, or how to delegate a lattice basis
Adaptively secure revocable hierarchical IBE from \(k\)-linear assumption
Can a public blockchain keep a secret?
Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
Identity-based broadcast encryption with efficient revocation
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Revocable Identity-Based Encryption from Lattices
New Revocable IBE in Prime-Order Groups: Adaptively Secure, Decryption Key Exposure Resistant, and with Short Public Parameters
Simplified Revocable Hierarchical Identity-Based Encryption from Lattices
Trapdoors for hard lattices and new cryptographic constructions
Efficient Lattice (H)IBE in the Standard Model
Attribute-Based Encryption Supporting Direct/Indirect Revocation Modes
Identity-Based Encryption from the Weil Pairing
Revocable Identity-Based Encryption Revisited: Security Model and Construction
Server-Aided Revocable Identity-Based Encryption
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
On lattices, learning with errors, random linear codes, and cryptography
Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
Anonymous public key encryption under corruptions
Simplified server-aided revocable identity-based encryption from lattices

This page was built for publication: Revocable IBE with En-DKER from lattices: a novel approach for lattice basis delegation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550612)