Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
From MaRDI portal
(Redirected from Publication:2215969)
Recommendations
- Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance
- Revocable Identity-Based Encryption from Lattices
- Server-aided revocable identity-based encryption from lattices
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
- Revocable identity-based encryption revisited: security model and construction
- Generic constructions of revocable identity-based encryption
- Simplified server-aided revocable identity-based encryption from lattices
- Simplified revocable hierarchical identity-based encryption from lattices
- CCA-secure revocable identity-based encryption schemes with decryption key exposure resistance
Cites work
- scientific article; zbMATH DE number 2081087 (Why is no real title available?)
- scientific article; zbMATH DE number 1842485 (Why is no real title available?)
- scientific article; zbMATH DE number 1405637 (Why is no real title available?)
- scientific article; zbMATH DE number 1418320 (Why is no real title available?)
- Adaptive-ID Secure Revocable Identity-Based Encryption
- Adaptive-ID secure revocable hierarchical identity-based encryption
- Adaptive-ID secure revocable identity-based encryption from lattices via subset difference method
- Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
- An Introduction to Computational Physics
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Bonsai trees, or how to delegate a lattice basis
- Bounded-collusion IBE from key homomorphism
- Classical hardness of learning with errors
- Constructions of CCA-Secure Revocable Identity-Based Encryption
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient (anonymous) compact HIBE from standard assumptions
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient lattice (H)IBE in the standard model
- Efficient revocable identity-based encryption via subset difference methods
- Efficient selective identity-based encryption without random oracles
- Families of finite sets in which no set is covered by the union of \(r\) others
- Functional encryption for threshold functions (or fuzzy IBE) from lattices
- Fuzzy Identity-Based Encryption
- Generating shorter bases for hard random lattices
- Identity-Based Encryption from the Weil Pairing
- Identity-based cryptosystems and signature schemes
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
- Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance
- New revocable IBE in prime-order groups: adaptively secure, decryption key exposure resistant, and with short public parameters
- On lattices, learning with errors, random linear codes, and cryptography
- On the untapped potential of encoding predicates by arithmetic circuits and their applications
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Public-key cryptosystems from the worst-case shortest vector problem
- Revocable Identity-Based Encryption from Lattices
- Revocable hierarchical identity-based encryption via history-free approach
- Revocable hierarchical identity-based encryption with shorter private keys and update keys
- Revocable identity-based encryption from codes with rank metric
- Revocable identity-based encryption from the computational Diffie-Hellman problem
- Server-aided revocable identity-based encryption from lattices
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Simplified revocable hierarchical identity-based encryption from lattices
- Topics in Cryptology – CT-RSA 2004
- Towards tightly secure lattice short signature and id-based encryption
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(12)- Constructions of CCA-Secure Revocable Identity-Based Encryption
- Revocable Identity-Based Encryption from Lattices
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
- CCA-secure revocable identity-based encryption schemes with decryption key exposure resistance
- Adaptive-ID secure revocable identity-based encryption from lattices via subset difference method
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
- Server-aided revocable identity-based encryption from lattices
- Revocable identity-based encryption revisited: security model and construction
- Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance
- Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity
- Simplified revocable hierarchical identity-based encryption from lattices
- Revocable IBE with En-DKER from lattices: a novel approach for lattice basis delegation
This page was built for publication: Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215969)
