Ring/module learning with errors under linear leakage -- hardness and applications
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
- A toolkit for ring-LWE cryptography
- Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
- Advances in cryptology -- ASIACRYPT 2016. 22nd international conference on the theory and application of cryptology and information security, Hanoi, Vietnam, December 4-8, 2016. Proceedings. Part II
- Advances in cryptology -- CRYPTO 2019. 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2019. Proceedings. Part I
- Advances in cryptology -- CRYPTO 2020. 40th annual international cryptology conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17--21, 2020. Proceedings. Part II
- Advances in cryptology -- CRYPTO 2022. 42nd annual international cryptology conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15--18, 2022. Proceedings. Part II
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Bi-deniable public-key encryption
- Circular and KDM security for identity-based encryption
- Efficient lattice (H)IBE in the standard model
- Efficient public key encryption based on ideal lattices (extended abstract)
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Lattice signatures without trapdoors
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Learning with rounding, revisited. New reduction, properties and applications
- Lossiness and entropic hardness for ring-LWE
- LWE with side information: attacks and concrete security estimation
- More efficient commitments from structured lattice assumptions
- New bounds in some transference theorems in the geometry of numbers
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On ideal lattices and learning with errors over rings
- On the hardness of module-LWE with binary secret
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Practical product proofs for lattice commitments
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- Rounding in the rings
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Worst-case to average-case reductions for module lattices
This page was built for publication: Ring/module learning with errors under linear leakage -- hardness and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635772)
