Two efficient tag-based encryption schemes on lattices
From MaRDI portal
Recommendations
- Theory of Cryptography
- Full secure identity-based encryption scheme with short public key size over lattices in the standard model
- ABE with tag made easy. Concise framework and new instantiations in prime-order groups
- Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
- Efficient lattice (H)IBE in the standard model
Cites work
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- CCA secure public key encryption scheme based on LWE without Gaussian sampling
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient lattice (H)IBE in the standard model
- Generating shorter bases for hard random lattices
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- scientific article; zbMATH DE number 1405637 (Why is no real title available?)
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- On lattices, learning with errors, random linear codes, and cryptography
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Public-key cryptosystems from the worst-case shortest vector problem
- Theory of Cryptography
- Theory of Cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(2)
This page was built for publication: Two efficient tag-based encryption schemes on lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297485)