Identity-based encryption from lattices using approximate trapdoors
From MaRDI portal
Publication:6535489
Recommendations
Cites work
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- A practical implementation of identity-based encryption over NTRU lattices
- A toolkit for ring-LWE cryptography
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
- Bonsai trees, or how to delegate a lattice basis
- Efficient identity-based encryption over NTRU lattices
- Efficient lattice (H)IBE in the standard model
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Gadget-based iNTRU lattice trapdoors
- Homomorphic encryption for finite automata
- Identity-based cryptosystems and signature schemes
- Implementation of lattice trapdoors on modules and applications
- Lattice signatures without trapdoors
- NTRU Fatigue: How Stretched is Overstretched?
- On the concrete hardness of learning with errors
- On the hardness of module learning with errors with short distributions
- Practical implementation of Ring-SIS/LWE based signature and IBE
- Predicting Lattice Reduction
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Sampling exactly from the normal distribution
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Towards a simpler lattice gadget toolkit
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for ideal lattices with applications
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Worst-case to average-case reductions for module lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
This page was built for publication: Identity-based encryption from lattices using approximate trapdoors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535489)
