Compact adaptively secure identity-based encryption from middle-product learning with errors
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
- Adaptively secure identity-based encryption from middle-product learning with errors
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Bonsai trees, or how to delegate a lattice basis
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient lattice (H)IBE in the standard model
- Efficient public key encryption based on ideal lattices (extended abstract)
- Identity-based cryptosystems and signature schemes
- Identity-based encryption from LWE with more compact master public key
- Lattice trapdoors and IBE from middle-product LWE
- Middle-product Learning with Errors
- On the ring-LWE and polynomial-LWE problems
- 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
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
This page was built for publication: Compact adaptively secure identity-based encryption from middle-product learning with errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846309)